Triangulating stable laminations
arXiv:1509.02829 · doi:10.1214/16-EJP4559
Abstract
We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random the faces of stable laminations, which are random compact subsets of the unit disk made of non-intersecting chords coded by stable Lévy processes. We also study other ways to "fill-in" the faces of stable laminations, which leads us to introduce the iteration of laminations and of trees.
arXiv comment34 pages, 5 figures
References in corpus (10)
- Random trees and applications
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Random stable looptrees
- A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees
- Random recursive triangulations of the disk via fragmentation theory
- The coding of compact real trees by real valued functions
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Random stable laminations of the disk
- On the number of large triangles in the Brownian triangulation and fragmentation processes
- Processes iterated ad libitum