Spinal partitions and invariance under re-rooting of continuum random trees

By Bénédicte Haas, Jim Pitman, Matthias Winkel. 2007

60 citations recorded by the source corpus.

We develop some theory of spinal decompositions of discrete and continuous fragmentation trees. Specifically, we consider a coarse and a fine spinal integer partition derived from spinal tree decompositions. We prove that for a two-parameter Poisson-Dirichlet family of continuous fragmentation trees, including the stable trees of Duquesne and Le Gall, the fine partition is obtained from the coarse one by shattering each of its parts independently, according to the same law. As a second application of spinal decompositions, we prove that among the continuous fragmentation trees, stable trees are the only ones whose distribution is invariant under uniform re-rooting.

Subfields: Artificial Intelligence, Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/344e01cbb912e4cd277025a1031ec589d245cda0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Mathematical Physics

In Statistics and Probability

Citations in the corpus

Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees (2010, background): “This general statement allows to recover and improve many results of [25, 26, 32, 14] dealing specifically with Markov branching trees.”