The stable trees are nested

DOI10.1007/S00440-012-0472-XzbMATH Open1286.60074arXiv1207.5418OpenAlexW2009619982MaRDI QIDQ389280FDOQ389280

Authors: Nicolas Curien, Bénédicte Haas 

Publication date: 20 January 2014

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: We show that we can construct simultaneously all the stable trees as a nested family. More precisely, if $1<a<a^{\prime }leq2$ 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.

Full work available at URL: https://arxiv.org/abs/1207.5418

Recommendations

• A line-breaking construction of the stable trees
• A binary embedding of the stable line-breaking construction
• Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
• The Hausdorff measure of stable trees
• Zooming in at the root of the stable tree

zbMATH Keywords

pruningdissipative self-similar fragmentationsMarchal's algorithmstable Lévy trees

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25)

Cites Work

• Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
• A course in metric geometry
• Tessellations of random maps of arbitrary genus
• Self-similar fragmentation derived from the stable tree. I: Splitting at heights
• Self-similar fragmentations
• Asymptotic laws for nonconservative self-similar fragmentations
• Probabilistic and fractal aspects of Lévy trees
• Title not available (Why is that?)
• Homogeneous fragmentation processes
• Ranked Fragmentations
• Spatial Branching Processes and Subordination
• Title not available (Why is that?)
• The continuum random tree. III
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The continuum random tree. I
• The genealogy of self-similar fragmentations with negative index as a continuum random tree
• Spinal partitions and invariance under re-rooting of continuum random trees
• Branching processes in Lévy processes: The exploration process
• Random real trees
• A limit theorem for the contour process of conditioned Galton-Watson trees
• Title not available (Why is that?)
• General fragmentation trees
• Pruning a Lévy 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
• Decorated stable trees
• Scaling limits of multi-type Markov branching 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
• Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
• Scaling limits and influence of the seed graph in preferential attachment trees
• 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)