A binary embedding of the stable line-breaking construction
From MaRDI portal
Abstract: We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of compact CRTs as presented in earlier work to a specific distribution of a random string of beads, i.e. a random interval equipped with a random discrete measure. We also express this CRT as a tree built by replacing all branch points of a stable tree by rescaled i.i.d. copies of a Ford CRT. Some of these developments are carried out in a space of infinity-marked metric spaces generalising Miermont's notion of a k-marked metric space.
Recommendations
- scientific article; zbMATH DE number 1113989
- A line-breaking construction of the stable trees
- Embeddings of binary trees in lines
- Reconstruction of line-embeddings of graphons
- Extension of line-splitting operation from graphs to binary matroids
- Extension of line-splitting operation from graphs to binary matroids
- Two results on linear embeddings of complete binary trees
- Optimal distortion embedding of complete binary trees into lines
- Stable graphs: distributions and line-breaking construction
- AI 2003: Advances in Artificial Intelligence
Cites work
- A course in metric geometry
- A limit theorem for the contour process of conditioned Galton-Watson trees
- A line-breaking construction of the stable trees
- A new family of Markov branching trees: the alpha-gamma model
- A survey of max-type recursive distributional equations
- An axiomatic characterization of the Brownian map
- Branch merging on continuum trees with applications to regenerative tree growth
- Branching processes in Lévy processes: The exploration process
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
- Growing random graphs with a preferential attachment structure
- scientific article; zbMATH DE number 6683511 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 1859371 (Why is no real title available?)
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Liouville quantum gravity as a mating of trees
- On the genealogy of conditioned stable Lévy forests
- Poisson calculus for spatial neutral to the right processes
- Probabilistic and fractal aspects of Lévy trees
- Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
- Random gluing of metric spaces
- Random real trees
- Random stable looptrees
- Random trees constructed by aggregation
- Rayleigh processes, real trees, and root growth with re-grafting
- Recursive construction of continuum random trees
- Regenerative composition structures
- Regenerative tree growth: binary self-similar continuum random trees and Poisson-Dirichlet compositions
- 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 derived from the stable tree. II: Splitting at nodes
- Spinal partitions and invariance under re-rooting of continuum random trees
- Stable graphs: distributions and line-breaking construction
- Subordination of trees and the Brownian map
- 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
- The stable trees are nested
- The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
Cited in
(4)
This page was built for publication: A binary embedding of the stable line-breaking construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171668)
