A random walk approach to Galton-Watson trees (Q1592274): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Götz-Dietrich Kersting / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vladimir A. Vatutin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1007862612753 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1506498195 / rank
 
Normal rank

Latest revision as of 09:20, 30 July 2024

scientific article
Language Label Description Also known as
English
A random walk approach to Galton-Watson trees
scientific article

    Statements

    A random walk approach to Galton-Watson trees (English)
    0 references
    0 references
    4 January 2002
    0 references
    An approach is discussed linking Galton-Watson trees with arbitrary offspring distributions to random walk excursions and bridges [this idea was used independently by \textit{J.-F. Le Gall} and \textit{Y. Le Jan}, Ann. Probab. 26, No. 1, 213-252 (1998; Zbl 0948.60071)]. Applying this approach the authors investigate Galton-Watson trees with binary, Poisson or geometric offspring distribution and reveal some connections to the Dirac, Bose-Einstein and Maxwell-Boltzmann statistics. They also analyze the structure of the subtree of all descendants of a randomly chosen individual of a tree conditioned to have fixed size \(n\), study the lines of ancestors and ladder points of a related random walk and use the established facts to construct Galton-Watson trees conditioned to survive a given number of generations.
    0 references
    branching processes
    0 references
    Galton-Watson trees
    0 references
    random walk excursions
    0 references
    functional limit theorems
    0 references
    random walk bridges
    0 references

    Identifiers