The CRT is the scaling limit of random dissections

2013/05/15 by Nicolas Curien, Curien, Nicolas, Bénédicte Haas +3 · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR) #math.CO #math.PR

paper · pdf · doi:10.48550/arxiv.1305.3534

arxiv created 2014/02/12 · arxiv updated 2014/02/13

Abstract

We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform p-angulations. As their number of vertices n goes to infinity, we show that these random graphs, rescaled by n^-1/2, converge in the Gromov--Hausdorff sense towards a multiple of Aldous' Brownian tree when the weights decrease sufficiently fast. The scaling constant depends on the Boltzmann weights in a rather amusing and intriguing way, and is computed by making use of a Markov chain which compares the length of geodesics in dissections with the length of geodesics in their dual trees.

Cited by

• Scaling limits of multitype Bienaymé trees

Related

• The CRT is the scaling limit of unordered binary trees
• On breadth-first constructions of scaling limits of random graphs and random unicellular maps
• On scaling limits of random Halin-like maps
• Scaling Limit of Random Planar Quadrangulations with a Boundary
• Scaling limit of graph classes through split decomposition