The CRT is the scaling limit of unordered binary trees
From MaRDI portal
Publication:5198666
DOI10.1002/rsa.20332zbMath1223.05027arXiv0902.4570OpenAlexW2036271708MaRDI QIDQ5198666
Jean-François Marckert, Grégory Miermont
Publication date: 9 August 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.4570
Related Items (16)
The distribution of height and diameter in random non-plane binary trees ⋮ A view from the bridge spanning combinatorics and probability ⋮ Random enriched trees with applications to random graphs ⋮ Scaling limits of random Pólya trees ⋮ Graphon convergence of random cographs ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ The degree profile of random Pólya trees ⋮ Scaling limits for some random trees constructed inhomogeneously ⋮ Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees ⋮ The shape of unlabeled rooted random trees ⋮ The gap between Gromov-Vague and Gromov-Hausdorff-vague topology ⋮ Self-similar real trees defined as fixed points and their geometric properties ⋮ Simply Generated Unrooted Plane Trees ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ Scaling limits for a family of unrooted trees ⋮ Scaling limit of random forests with prescribed degree sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The continuum random tree. I
- Rayleigh processes, real trees, and root growth with re-grafting
- Functionals of Brownian meander and Brownian excursion
- A limit theorem for the contour process of conditioned Galton-Watson trees
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- Self-similar fragmentations
- Probabilistic and fractal aspects of Lévy trees
- The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
- Limit distributions and random trees derived from the birthday problem with unequal probabilities
- The continuum random tree. III
- The topological structure of scaling limits of large planar maps
- Subtree prune and regraft: a reversible real tree-valued Markov process
- The number of trees
- The height of random binary unlabelled trees
This page was built for publication: The CRT is the scaling limit of unordered binary trees