The CRT is the scaling limit of random dissections

DOI10.1002/RSA.20554zbMath1322.05123arXiv1305.3534OpenAlexW2064075106MaRDI QIDQ3192383

Igor Kortchemski, Nicolas Curien, Bénédicte Haas

Publication date: 12 October 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.3534

zbMATH Keywords

scaling limitsGromov-Hausdorff topologyGalton-Watson treesBrownian continuum random treerandom dissections

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Polytopes and polyhedra (52B99)

Related Items (15)

Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees ⋮ Limits of the boundary of random planar maps ⋮ Excursion theory for Brownian motion indexed by the Brownian tree ⋮ Scaling limits of random Pólya trees ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Limits of random tree-like discrete structures ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Decorated stable trees ⋮ On random trees and forests ⋮ The boundary of random planar maps via looptrees ⋮ Invariance principles for random walks in random environment on trees ⋮ Percolation on random triangulations and stable looptrees ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ Spaces of algebraic measure trees and triangulations of the circle ⋮ Scaling limits of random planar maps with a unique large face

Cites Work

• Unnamed Item
• Invariance principles for Galton-Watson trees conditioned on the number of leaves
• Random recursive triangulations of the disk via fragmentation theory
• On properties of random dissections and triangulations
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• Percolation on random triangulations and stable looptrees
• The continuum random tree. I
• Random trees and applications
• Some families of increasing planar maps
• Large deviations of uniformly recurrent Markov additive processes
• Subdiffusive behavior of random walk on a random cluster
• Properties of random triangulations and trees
• Analytic combinatorics of non-crossing configurations
• The distribution of the maximum vertex degree in random planar maps
• Scaling limit of random planar quadrangulations with a boundary
• Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
• Scaling limits of random planar maps with a unique large face
• Random stable laminations of the disk
• Extremal statistics on non-crossing configurations
• Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions
• Probability on Trees and Networks
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• Triangulating the Circle, at Random
• Markov additive processes. I

This page was built for publication: The CRT is the scaling limit of random dissections