Scaling limits for a family of unrooted trees
From MaRDI portal
Publication:2954458
zbMath1355.60116arXiv1604.08287MaRDI QIDQ2954458
Publication date: 13 January 2017
Full work available at URL: https://arxiv.org/abs/1604.08287
Infinitely divisible distributions; stable distributions (60E07) Processes with independent increments; Lévy processes (60G51) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Functional limit theorems; invariance principles (60F17)
Related Items
The distance profile of rooted and unrooted simply generated trees ⋮ Random enriched trees with applications to random graphs ⋮ Simply Generated Unrooted Plane Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- The continuum random tree. I
- Itô's excursion theory and random trees
- Random trees and applications
- Behavior near the extinction time in self-similar fragmentations. I: The stable case
- Williams' decomposition of the Lévy continuum random tree and simultaneous extinction probability for populations with neutral mutations
- On the re-rooting invariance property of Lévy trees
- Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
- Branching processes in Lévy processes: The exploration process
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Self-similar fragmentation derived from the stable tree. I: Splitting at heights
- The genealogy of self-similar fragmentations with negative index as a continuum random tree
- Probabilistic and fractal aspects of Lévy trees
- Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
- The continuum random tree. III
- Fragmentation associated with Lévy processes using snake
- The Galton-Watson process conditioned on the total progeny
- On the Altitude of Nodes in Random Trees
- The CRT is the scaling limit of unordered binary trees
