The CRT is the scaling limit of unordered binary trees (Q5198666): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036271708 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0902.4570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuum random tree. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuum random tree. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-similar fragmentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The height of random binary unlabelled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit distributions and random trees derived from the birthday problem with unequal probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the contour process of conditioned Galton-Watson trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic and fractal aspects of Lévy trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functionals of Brownian meander and Brownian excursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rayleigh processes, real trees, and root growth with re-grafting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree prune and regraft: a reversible real tree-valued Markov process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of scaling limits of large planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The depth first processes of Galton-Watson trees converge to the same Brownian excursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226355 / rank
 
Normal rank

Latest revision as of 09:49, 4 July 2024

scientific article; zbMATH DE number 5937286
Language Label Description Also known as
English
The CRT is the scaling limit of unordered binary trees
scientific article; zbMATH DE number 5937286

    Statements

    The CRT is the scaling limit of unordered binary trees (English)
    0 references
    0 references
    9 August 2011
    0 references
    0 references
    CRT
    0 references
    unordered trees
    0 references
    weak convergence
    0 references
    Pólya trees
    0 references
    Gromov Hausdorff
    0 references
    0 references
    0 references