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

Random Structures and Algorithms

Volumn 8, Issue 4, 1996, Pages 243-299

  Kesten, Harry ^a   Pittel, Boris ^b  

^a Department of Obstetrics Gynecology   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Branching processes; Extinction time; Height; Leaves; Local limit theorem; Random trees; Total progeny

Indexed keywords

EID: 0042358792     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199607)8:4<243::AID-RSA1>3.0.CO;2-Y     Document Type: Article

References (25)

1. D. Aldous, The continuum random tree II: an overview, in Stochastic Analysis, M. T. Barlow and N. H. Bingham, Eds., London Math. Soc. Lecture Note Series, Vol. 167, 1991, pp. 23-70.
2. K. B. Athreya and P. E. Ney, Branching Processes, Springer-Verlag, New York, 1972.
3. R. Durrett, Conditioned limit theorems for some null recurrent Markov processes, Ann. Probab., 6, 798-828 (1978).
4. M. Dwass, The total progeny in a branching process and a related random walk, J. Appl. Probab. 6, 682-686 (1969).
5. H. Dym and H. P. McKean, Fourier Series and Integrals, Academic, New York, 1972.
6. A. Erdélyi, Tables of Integral Transforms, McGraw-Hill, New York, 1954, Vol. 1.
7. P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, J. Comput. Syst. Sci. 25, 171-213 (1982).
8. P. Flajolet, Z. Gao, A. Odlyzko and B. Richmond, The distribution of heights of binary trees and other simple trees, J. Combinatorics, Probability and Computing, 2, 145-156 (1993).
9. B. V. Gnedenko and A. N. Kolmogorov, Limit Distributions for Sums of Independent Random Variables, Addison-Wesley, Reading, MA, 1954.
10. T. E. Harris, The Theory of Branching Processes, Prentice Hall, Englewood Cliffs, NJ, 1963.
11. P. Jagers, Branching Processes with Biological Applications, Wiley, New York, 1975.
12. D. P. Kennedy, The Galton-Watson process conditioned on the total progeny, J. Appl. Probab., 12, 800-806 (1975).
13. H. Kesten, A limit theorem for weighted branching process trees, in The Dynkin Festschrift, M. Freidlin, Ed., Birkhäuser, Basel, 1994, pp. 153-166.
14. H. Kesten, P. Ney and F. Spitzer, The Galton-Watson process with mean one and finite variance, Theor. Veroyatnost Primen., 11, 579-611 (1966).
15. V. F. Kolchin, Moment of degeneration of a branching process and height of a random tree, Math. Notes Acad. Sci. USSR, 24, 954-961 (1978).
16. V. F. Kolchin, Random Mappings, Optimization Software, 1986.
17. T. Łuczak, The number of trees with large diameter, J. Austral. Math. Soc. (Ser. A), 58, 298-311 (1995).
18. A. M. Odlyzko and H. S. Wilf, Bandwidths and profiles of trees, J. Combinat. Theor. B, 42, 348-370 (1987).
19. A. G. Pakes, Remarks on the maxima of a martingale sequence with application to the simple critical branching process, J. Appl. Probab., 24, 768-772 (1987).
20. R. C. Read, The coding of various kinds of unlabeled trees, in Graph Theory and Computing, (R. C. Read, Ed.), Academic, New York, 1972.
21. A. Rényi and G. Szekeres, On the height of trees, J. Austr. Math. Soc., 7, 497-507 (1967).
22. E. Seneta, The Galton-Watson process with mean one, J. Appl. Probab., 4, 489-495 (1967).
23. V. E. Stepanov, On the distribution of the number of vertices in strata of a random tree, Theor. Probab. Appl., 14, 65-78 (1969).
24. L. Takács, Conditional limit theorems for branching processes, J. Appl. Math. Stoch. Anal., 4, 263-292 (1991).
25. L. Takács, Limit distributions for queues and random rooted trees, J. Appl. Math. Stoch. Anal., 6, 189-216 (1993).