The dual tree of a recursive triangulation of the disk

Abstract

In the recursive lamination of the disk, one tries to add chords one after another at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. Curien and Le Gall [Ann. Probab. 39 (2011) 2224-2270] have proved that the set of chords converges to a limit triangulation of the disk encoded by a continuous process $\mathcal{M}$. Based on a new approach resembling ideas from the so-called contraction method in function spaces, we prove that, when properly rescaled, the planar dual of the discrete lamination converges almost surely in the Gromov-Hausdorff sense to a limit real tree $\mathcal{T}$, which is encoded by $\mathcal{M}$. This confirms a conjecture of Curien and Le Gall.

Published in at http://dx.doi.org/10.1214/13-AOP894 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (7)

• On a functional contraction method
• The local weak limit of the minimum spanning tree of the complete graph
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• Random stable laminations of the disk
• A limit process for partial match queries in random quadtrees and $2$-d trees
• A growth model for RNA secondary structures
• The scaling limit of the minimum spanning tree of the complete graph

Cited by in corpus (1)

• Spaces of algebraic measure trees and triangulations of the circle