Related papers: Some results on maps that factor through a tree
This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…
We introduce a class of maps from an affine flat into a Riemannian manifold that solve an elliptic system defined by the natural second order elliptic operator of the affine structure and the nonlinear Riemann geometry of the target. These…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is…
A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…
A self-similar growth-fragmentation describes the evolution of particles that grow and split as time passes. Its genealogy yields a self-similar continuum tree endowed with an intrinsic measure. Extending results of Haas for pure…
We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…
We revisit certain path-lifting and path-continuation properties of abstract maps as described in the work of F. Browder and R. Rheindboldt in 1950-1960s, and apply their elegant theory to exponential maps. We obtain thereby a number of…
Metrics on rooted phylogenetic trees are integral to a number of areas of phylogenetic analysis. Cluster-similarity metrics have recently been introduced in order to limit skew in the distribution of distances, and to ensure that trees in…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
Any algebraic connection on a vector bundle on a smooth complex algebraic curve determines an irregular class and in turn a fission tree at each puncture. The fission trees are the discrete data classifying the admissible deformation…
Using quaternions and octonions, we construct some maps from the Grassmannian of 2-dimensional planes of $\mathbb{R}^n$, $\mathrm{Gr}_2(\mathbb{R}^n)$, to the projective space $\mathbb{R}\mathrm{P}^k$, for certain values of $n$ and $k$. All…
The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…
We consider conducting inference on the output of the Classification and Regression Tree (CART) [Breiman et al., 1984] algorithm. A naive approach to inference that does not account for the fact that the tree was estimated from the data…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related…
We consider the numerical taxonomy problem of fitting a positive distance function ${D:{S\choose 2}\rightarrow \mathbb R_{>0}}$ by a tree metric. We want a tree $T$ with positive edge weights and including $S$ among the vertices so that…
We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that…
Two simple predicates are adopted and certain real-valued piecewise continuous functions are constructed from them. This type of maps will be called quasi-step maps and aim to separate the fixed points of an iteration map in an interval.…
Huynh, Joret, Micek, Seweryn, and Wollan (Combinatorica, 2022) introduced a graph parameter, later referred to as 2-treedepth and denoted $\mathrm{td}_2(\cdot)$. The parameter is the natural 2-connected version of treedepth. For every…