Related papers: Labeled Trees Generating Separable and Locally Fin…
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…
This paper is the first of a sequence of three papers, where the concept of an $\mathbb R$-tree dual to a measured geodesic lamination in a hyperbolic surface is generalized to arbitrary $\mathbb R$-trees provided with a (very small) action…
It is well-known that quasi-isometries between R-trees induce power quasi-symmetric homeomorphisms between their ultrametric end spaces. This paper investigates power quasi-symmetric homeomorphisms between bounded, complete, uniformly…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
We study a new bi-Lipschitz invariant \lambda(M) of a metric space M; its finiteness means that Lipschitz functions on an arbitrary subset of M can be linearly extended to functions on M whose Lipschitz constants are enlarged by a factor…
We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for…
The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established…
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…
It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…
For a finitely generated group $G$, we introduce an asymmetric pseudometric on projectivized deformation spaces of $G$-trees, using stretching factors of $G$-equivariant Lipschitz maps, that generalizes the Lipschitz metric on Outer space…
Each labeled rooted tree is associated with a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests.…
Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…
We say that a finitely generated group $G$ has property (QT) if it acts isometrically on a finite product of quasi-trees so that orbit maps are quasi-isometric embeddings. A quasi-tree is a connected graph with path metric quasi-isometric…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
We give a de Finetti type representation for exchangeable random coalescent trees (formally described as semi-ultrametrics) in terms of sampling iid sequences from marked metric measure spaces. We apply this representation to define…
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…