A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree

DOI<243::AID-RSA1>3.0.CO;2-Y 10.1002/(SICI)1098-2418(199607)8:4<243::AID-RSA1>3.0.CO;2-YzbMath0856.60030OpenAlexW2021058889MaRDI QIDQ4888164

Harry Kesten, Boris G. Pittel

Publication date: 27 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199607)8:4<243::aid-rsa1>3.0.co;2-y

zbMATH Keywords

generating functioncritical Bienaymé-Galton-Watson processfamily tree of the branching process

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Branching random walks with acritical branching part, Invariance principles for Galton-Watson trees conditioned on the number of leaves, Pattern avoiding permutations with a unique longest increasing subsequence, Itô's excursion theory and random trees, On the number of vertices with a given degree in a Galton-Watson tree, On a random search tree: asymptotic enumeration of vertices by distance from leaves, Coalescent random forests, Limiting probabilities for vertices of a given rank in 1-2 trees, Limit theorems for conditioned non-generic Galton-Watson trees