Asymptotic degree distribution in random recursive trees

Random Structures and Algorithms

Volumn 26, Issue 1-2, 2005, Pages 69-83

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22144485497     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20046     Document Type: Conference Paper

References (23)

1. K. B. Athreya and S. Karlin, Embedding of urn schemes into continuous time Markov branching processes and related limit theorems, Ann Math Statist 39 (1968), 1801-1817.
2. K. B. Athreya and P. E. Ney, Branching processes. Springer, Berlin, 1972.
3. A. Bagchi and A. K. Pal, Asymptotic normality in the generalized Pólya-Eggenberger urn model, with an application to computer data structures, SIAM J Algebraic Discrete Methods 6(3) (1985), 394-405.
4. Z. D. Bai and F. Hu, Asymptotic theorems for urn models with nonhomogeneous generating matrices. Stochastic Process Appl 80(1) (1999), 87-101.
5. Z. D. Bai, F. Hu, and L.-X. Zhang, Gaussian approximation theorems for urn models and their applications, Ann. Appl. Probab. 12(4) (2002), 1149-1173.
6. F. Bergeron, P. Flajolet, and B. Salvy, "Varieties of increasing trees," CAAP '92 (Rennes, 1992), Lecture Notes in Computer Science 581, 24-48. Springer, Berlin, 1992.
7. P. Billingsley, Convergence of probability measures, Wiley, New York, 1968.
8. B. Chauvin and N. Pouyanne, m-ary search trees when m ≥ 27: A strong asymptotics for the space requirements, Random Structures Algorithms 24(2) (2004), 133-154.
9. H.-H. Chern and H.-K. Hwang, Phase changes in random m-ary search trees and generalized quicksort, Random Structures Algorithms 19(3-4) (2001), 316-358.
10. L. Devroye, Limit laws for local counters in random binary search trees, Random Structures Algorithms 2(3) (1991), 303-315.
11. S. Janson, Functional limit theorems for multitype branching processes and generalized Pólya urns, Stochastic Process Appl 110(2) (2004), 177-245.
12. N. L. Johnson and S. Kotz, Urn models and their application, Wiley, New York, 1977.
13. S. Karlin, A first course in stochastic processes, Academic Press, New York, 1969.
14. W. Lew and H. M. Mahmoud, The joint distribution of elastic buckets in multiway search trees, SIAM J Comput 23(5) (1994), 1050-1074.
15. H. M. Mahmoud, The size of random bucket trees via urn models, Acta Inform 38(11-12) (2002), 813-838.
16. H. M. Mahmoud and R. T. Smythe, Asymptotic joint normality of outdegrees of nodes in random recursive trees, Random Structures Algorithms 3(3) (1992), 255-266.
17. H. M. Mahmoud, R. T. Smythe, and J. Szymański, On the structure of random plane-oriented recursive trees and their branches, Random Structures Algorithms 4(2) (1993), 151-176.
18. A. Meir and J. W. Moon, Recursive trees with no nodes of out-degree one, Congr Numer 66 (1988), 49-62.
19. N. S. Na and A. Rapoport, Distribution of nodes of a tree by degree, Math Biosci 6 (1970), 313-329.
20. D. Najock and C. C. Heyde, On the number of terminal vertices in certain random trees with an application to stemma construction in philology, J Appl Probab 19(3) (1982), 675-680.
21. E. Seneta, Nonnegative matrices and Markov chains, 2nd edition, Springer, New York, 1981.
22. R. T. Smythe, Central limit theorems for urn models, Stochastic Process Appl 65(1) (1996), 115-137.
23. R. T. Smythe and H. Mahmoud, A survey of recursive trees, Theory Probab Math Statist 51 (1995), 1-27.