The stable trees are nested
From MaRDI portal
Abstract: We show that we can construct simultaneously all the stable trees as a nested family. More precisely, if we prove that hidden inside any a-stable we can find a version of an a'-stable tree rescaled by an independent Mittag-Leffler type distribution. This tree can be explicitly constructed by a pruning procedure of the underlying stable tree or by a modification of the fragmentation associated with it. Our proofs are based on a recursive construction due to Marchal which is proved to converge almost surely towards a stable tree.
Recommendations
Cites work
- scientific article; zbMATH DE number 6683511 (Why is no real title available?)
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- scientific article; zbMATH DE number 1859371 (Why is no real title available?)
- A course in metric geometry
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Asymptotic laws for nonconservative self-similar fragmentations
- Branching processes in Lévy processes: The exploration process
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
- General fragmentation trees
- Homogeneous fragmentation processes
- Probabilistic and fractal aspects of Lévy trees
- Pruning a Lévy continuum random tree
- Random real trees
- Ranked Fragmentations
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Self-similar fragmentation derived from the stable tree. I: Splitting at heights
- Self-similar fragmentations
- Spatial Branching Processes and Subordination
- Spinal partitions and invariance under re-rooting of continuum random trees
- Tessellations of random maps of arbitrary genus
- The continuum random tree. I
- The continuum random tree. III
- The genealogy of self-similar fragmentations with negative index as a continuum random tree
Cited in
(17)- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
- Scaling Limits of Markov-Branching Trees and Applications
- Stable trees as mixings of inhomogeneous continuum random trees
- A line-breaking construction of the stable trees
- Scaling limits of multi-type Markov branching trees
- Decorated stable trees
- Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process
- A binary embedding of the stable line-breaking construction
- A recursive distributional equation for the stable tree
- Scaling limits of k-ary growing trees
- Scaling limits and influence of the seed graph in preferential attachment trees
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
- Stable graphs: distributions and line-breaking construction
- Scaling limits for some random trees constructed inhomogeneously
- The gap between Gromov-Vague and Gromov-Hausdorff-vague topology
- Explosion and linear transit times in infinite trees
- Growing random graphs with a preferential attachment structure
This page was built for publication: The stable trees are nested
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389280)