Related papers: Local limits of one-sided trees

The height of a random PATRICIA tree built from independent, identically distributed infinite binary strings with arbitrary diffuse probability distribution $\mu$ on $\{0,1\}^\mathbb{N}$ is studied. We show that the expected height grows…

We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.

For a vertex $u$ of a tree $T$, the leaf (internal, respectively) status of $u$ is the sum of the distances from $u$ to all leaves (internal vertices, respectively) of $T$. The minimum (maximum, respectively) leaf status of a tree $T$ is…

We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…

We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…

We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

We consider a continuous-time random walk on a regular tree of finite depth and study its favorite points among the leaf vertices. For the walk started from a leaf vertex and stopped upon hitting the root we prove that, in the limit as as…

Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…

The scaling properties of the maximal height of a growing self-affine surface with a lateral extent $L$ are considered. In the late-time regime its value measured relative to the evolving average height scales like the roughness: $h^{*}_{L}…

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…

Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit…

We consider a family of growth models defined using conformal maps in which the local growth rate is determined by $|\Phi_n'|^{-\eta}$, where $\Phi_n$ is the aggregate map for $n$ particles. We establish a scaling limit result in which…

Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…

We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

We study the shape of the normalized stable L\'{e}vy tree $\mathcal{T}$ near its root. We show that, when zooming in at the root at the proper speed with a scaling depending on the index of stability, we get the unnormalized Kesten tree. In…