The stable trees are nested (Q389280): Difference between revisions

From MaRDI portal
Normalize DOI.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/S00440-012-0472-X / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00440-012-0472-X / rank
 
Normal rank

Latest revision as of 16:06, 9 December 2024

scientific article
Language Label Description Also known as
English
The stable trees are nested
scientific article

    Statements

    The stable trees are nested (English)
    0 references
    0 references
    0 references
    20 January 2014
    0 references
    The authors prove that hidden inside any stable tree of parameter \(\alpha\), \(\alpha\in (1,2)\), there exists a rescaled version of a stable tree of parameter \(\alpha^\prime\), \(\alpha^\prime\in (\alpha,2]\) which can be constructed by a pruning procedure and can be interpreted as the genealogical tree of a pure-jump self-similar fragmentation of index \(-(1-\alpha^{-1})\) and an explicitly given dislocation measure. As a consequence, there exists a family of rescaled nested stable trees. It was known from earlier works that a stable tree can be approximated as \(n\to\infty\) in probability in the Gromov-Hausdorff-Prokhorov topology by a sequence of random trees on \(n\) vertices. The authors show that the approximation holds almost surely, and this serves as the key technical tool of the present paper.
    0 references
    stable Lévy trees
    0 references
    pruning
    0 references
    dissipative self-similar fragmentations
    0 references
    Marchal's algorithm
    0 references

    Identifiers