journal article May 21, 2004

The shape of large Galton‐Watson trees with possibly infinite variance

View at Publisher Save 10.1002/rsa.20021
Abstract
AbstractLet T be a critical or subcritical Galton‐Watson family tree with possibly infinite variance. We are interested in the shape of T conditioned to have a large total number of vertices. For this purpose we study random trees whose conditional distribution given their size is the same as the respective conditional distribution of T. These random family trees have a simple probabilistic structure if decomposed along the lines of descent of a number of distinguished vertices chosen uniformly at random. The shape of the subtrees spanned by the selected vertices and the root depends essentially on the tail of the offspring distribution: While in the finite variance case the subtrees are asymptotically binary, other shapes do persist in the limit if the variance is infinite. In fact, we show that these subtrees are Galton‐Watson trees conditioned on their total number of leaves. The rescaled total size of the trees is shown to have a gamma limit law. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004
Topics

No keywords indexed for this article. Browse by subject →

References
31
[8]
Bingham N. H. (1989)
[10]
den Hollander F. (2000)
[12]
Duquesne T. "Random trees, Lévy processes and spatial branching processes" Astérisque (2002)
[17]
Feller W. (1971)
[20]
J.GeigerandG.Kersting The Galton‐Watson tree conditioned on its height Proc 7th Vilnius Conf 1998 VSP Utrecht 1999 pp.277–286. 10.1515/9783112313480-025
[23]
Exact distributions of kin numbers in a Galton-Watson process

A. Joffe, W. A. O'n. Waugh

Journal of Applied Probability 10.2307/3213829
[25]
Kennedy D. J. "The Galton‐Watson process conditioned on the total progeny" J Appl Probab (1975) 10.2307/3212730
[26]
Kolchin V. F. (1986)
[29]
Neveu J. "Abres et processus de Galton‐Watson" Ann Inst H Poincaré (1986)
[30]
Pitman J. "Enumerations of trees and forests related to branching processes and random walks" DIMACS Ser Discrete Math Theoret Comput Sci (1998) 10.1090/dimacs/041/08
[31]
Takács L. "The asymptotic distribution of the total heights of random rooted trees" Acta Sci Math (1993)
Metrics
14
Citations
31
References
Details
Published
May 21, 2004
Vol/Issue
25(3)
Pages
311-335
License
View
Cite This Article
Jochen Geiger, Lars Kauffmann (2004). The shape of large Galton‐Watson trees with possibly infinite variance. Random Structures & Algorithms, 25(3), 311-335. https://doi.org/10.1002/rsa.20021
Related

You May Also Like

Survey propagation: An algorithm for satisfiability

A. Braunstein, M. Mézard · 2005

260 citations

Regularity Lemma for k‐uniform hypergraphs

Vojtěch Rödl, Jozef Skokan · 2004

151 citations

The transitive closure of a random digraph

Richard M. Karp · 1990

133 citations

Balls and bins: A study in negative dependence

Devdatt Dubhashi, Desh Ranjan · 1998

107 citations

Cores in random hypergraphs and Boolean formulas

Michael Molloy · 2005

97 citations