Scaling limits for some random trees constructed inhomogeneously

Abstract

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely to a real tree in the Gromov-Hausdorff-Prokhorov sense. The limiting real trees are constructed via line-breaking the real half-line with a Poisson process having rate $(\ell +1)t^{\ell }dt$, for each positive integer $\ell$, and the growth of the combinatorial trees may be viewed as an inhomogeneous generalization of Rémy's algorithm.

31 pages

References in corpus (6)

• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
• The local weak limit of the minimum spanning tree of the complete graph
• Regenerative tree growth: Markovian embedding of fragmenters, bifurcators, and bead splitting processes
• Joint convergence of random quadrangulations and their cores
• The Brownian plane with minimal neck baby universe