A recursive distribution equation for the stable tree
arXiv:1812.08636
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.
arXiv comment30 pages, 5 figures
References in corpus (6)
- A survey of max-type recursive distributional equations
- Self-similar fragmentations derived from the stable tree II: splitting at nodes
- Spinal partitions and invariance under re-rooting of continuum random trees
- Random recursive triangulations of the disk via fragmentation theory
- The coding of compact real trees by real valued functions
- Regenerative tree growth: Markovian embedding of fragmenters, bifurcators, and bead splitting processes