A recursive distributional equation for the stable tree
From MaRDI portal
Publication:6201839
Abstract: We provide a new characterisation of Duquesne and Le Gall's -stable tree, , as the solution of a recursive distribution equation (RDE) of the form , where is a concatenation operator, a sequence of scaling factors, , , and are i.i.d. trees independent of . This generalises a version of the well-known characterisation of the Brownian Continuum Random Tree due to Aldous, Albenque and Goldschmidt. By relating to previous results on a rather different class of RDE, we explore the present RDE and obtain for a large class of similar RDEs that the fixpoint is unique (up to multiplication by a constant) and attractive.
Recommendations
- The Brownian continuum random tree as the unique solution to a fixed point equation
- On a linear recursive distributional equation
- A new characterization of endogeny
- A necessary and sufficient condition for the tail-triviality of a recursive tree process
- A survey of max-type recursive distributional equations
Cites work
- scientific article; zbMATH DE number 6683511 (Why is no real title available?)
- scientific article; zbMATH DE number 1859371 (Why is no real title available?)
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- A survey of max-type recursive distributional equations
- Beta-coalescents and continuous stable random trees
- Decomposition of Lévy trees along their diameter
- Ferguson distributions via Polya urn schemes
- Inverting the cut-tree transform
- On the genealogy of conditioned stable Lévy forests
- 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.
- Recursive construction of continuum random trees
- Recursive self-similarity for random trees, random triangulations and Brownian excursion
- Regenerative tree growth: Markovian embedding of fragmenters, bifurcators, and bead splitting processes
- Self-similar fragmentations
- Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
- Self-similar real trees defined as fixed points and their geometric properties
- Self-similarity and spectral asymptotics for the continuum random tree
- Spinal partitions and invariance under re-rooting of continuum random trees
- Tessellations of random maps of arbitrary genus
- The Brownian continuum random tree as the unique solution to a fixed point equation
- The continuum random tree. III
- The contraction method for recursive algorithms
- The stable trees are nested
- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
This page was built for publication: A recursive distributional equation for the stable tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201839)