Triangulating stable laminations
From MaRDI portal
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'evy 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.
Recommendations
Cited in
(15)- Sullivan's lamination of a planar region
- Triangulations and the stability theorem for foliations
- A geometric representation of fragmentation processes on stable trees
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- The dual tree of a recursive triangulation of the disk
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- Tchebyshev triangulations of stable simplicial complexes
- Random stable laminations of the disk
- Convergence of uniform noncrossing partitions toward the Brownian triangulation
- Random laminations and multitype branching processes
- A Controlled Plus Construction for Crumpled Laminations
- On scaling limits of multitype Galton-Watson trees with possibly infinite variance
- Scaling limit of multitype Galton-Watson trees with infinitely many types
- The distance profile of rooted and unrooted simply generated trees
- Decorated stable trees
This page was built for publication: Triangulating stable laminations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287698)