Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees (Q5198661): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/rsa.20319 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973441387 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0812.3326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic fringe distributions for general families of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-based models for random distribution of mass / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit laws for embedded trees: Applications to the integrated superBrownian excursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of the ISE and local limit laws for embedded trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total progeny in a branching process and a related random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random cutting and records in deterministic and random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Altitude of Nodes in Random Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/RSA.20319 / rank
 
Normal rank

Latest revision as of 16:18, 30 December 2024

scientific article; zbMATH DE number 5937281
Language Label Description Also known as
English
Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees
scientific article; zbMATH DE number 5937281

    Statements

    Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees (English)
    0 references
    0 references
    0 references
    9 August 2011
    0 references
    random Galton-Watson tree
    0 references
    paths of given length
    0 references
    vertical profile
    0 references
    probabilistic analysis of algorithms
    0 references
    branching process
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references