Profiles of random trees: Plane-oriented recursive trees

Random Structures and Algorithms

Volumn 30, Issue 3, 2007, Pages 380-413

  Hwang, Hsien Kuei ^a  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247466528     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20139     Document Type: Article

References (48)

1. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev Mod Phys 74 (2002), 47-97.
2. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
3. F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, In CAAP'92 (Rennes, 1992), Lecture Notes in Computer Science, 581, Springer, Berlin, 1992, pp. 24-48.
4. J. D. Biggins and D. R. Grey, A note on the growth of random trees, Stat Probab Lett 32 (1997), 339-342.
5. B. Bollobás and O. M. Riordan, "Mathematical results on scale-free random graphs," Handbook of Graphs And Networks, Wiley-VCH, Weinheim, 2003, pp. 1-34.
6. B. Bollobás and O. Riordan, Shortest paths and load scaling in scale-free trees, Phys Rev E 69 (2004) Article 036114 (7 pages).
7. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Struct Algor 18 (2001), 279-290.
8. W.-C. Chen and W.-C. Ni, Heap-ordered trees, 2-partitions and continued fractions, Eur J Combinator 15 (1994), 513-517.
9. W.-C. Chen and W.-C. Ni, Internal path length of the binary representation of heap-ordered trees, Inform Process Lett 51 (1994), 129-132.
10. W.-C. Chen and W.-C. Ni, On the average altitude of heap-ordered trees, Int J Found Comp Sci 5 (1994), 99-109.
11. H.-H. Chern and H.-K. Hwang, Phase changes in random m-ary search trees and generalized quicksort, Random Struct Algor 19 (2001), 316-358.
12. H.-H. Chern, H.-K. Hwang, and T. H. Tsai, An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms, J Algor 44 (2002), 177-225.
13. G. D. da Fonseca and C. M. H. de Figueiredo, Kinetic heap-ordered trees: Tight analysis and improved algorithms, Inform Process Lett 85 (2003), 165-169.
14. L. Devroye and H.-K. Hwang, Width and mode of the profile for random trees of logarithmic height, Ann Appl Probab 16 (2005), 886-918.
15. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks, Adv Phys 51 (2002), 1079-1187.
16. M. Drmota and B. Gittenberger, On the profile of random trees, Random Struct Algor 10 (1997), 421-451.
17. M. Drmota and H.-K. Hwang, Bimodality and phase transitions in the profile variance of random binary search trees, SIAM J Discrete Math 19 (2005), 19-45.
18. M. Drmota and H.-K. Hwang, Profiles of random trees: Correlation and width of random recursive trees and binary search trees, Adv Appl Probab 37 (2005), 321-341.
19. J. A. Fill and N. Kapur, Limiting distributions for additive functionals on Catalan trees, Theor Comp Sci 326 (2004), 69-102.
20. P. Flajolet and G. Louchard, Analytic variations on the Airy distribution, Algorithmica 31 (2001), 361-377.
21. P. Flajolet and A. M. Odlyzko, Singularity analysis of generating functions, SIAM J Discrete Math 3 (1990), 216-240.
22. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan, The pairing heap: A new form of self-adjusting heap, Algorithmica 1 (1986), 111-129.
23. M. Fuchs, H.-K. Hwang, and R. Neininger, Profiles of random trees: Limit theorems for random recursive trees and binary search trees, Algorithmica, in press (2005).
24. B. Gittenberger, "The number of descendants in simply generated random trees," Mathematics and Computer Science, (Versailles, 2000), Birkhäuser, Basel, pp. 65-73.
25. R. Grossman and R. G. Larson, Hopf-algebraic structure of families of trees, J Alg 126 (1989), 184-210.
26. H.-K. Hwang, Asymptotic expansions for the Stirling numbers of the first kind, J Combinator Theor A 71 (1995), 343-351.
27. S. Janson, Asymptotic degree distribution in random recursive trees, Random Struct Algor 26 (2005), 69-83.
28. H. Jeong, Z. Neda, and A.-L. Barabási, Measuring preferential attachment for evolving networks, Europhys Lett 61 (2003), 567-572.
29. D. E. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Second ed., Addison-Wesley, Reading, MA, 1997.
30. J. Lu and Q. Feng, Strong consistency of the number of vertices of given degrees in nonuniform random recursive trees, Yokohama Math J 45 (1998), 61-69.
31. H. M. Mahmoud, Distances in random plane-oriented recursive trees, J Comput Appl Math 41 (1992), 237-245.
32. H. M. Mahmoud, R. T. Smythe, and J. Szymanski, On the structure of random plane-oriented recursive trees and their branches, Random Struct Algor 4 (1993), 151-176.
33. T. F. Móri, On random trees, Stud Sei Math Hung 39 (2002), 143-155.
34. T. F. Móri, The maximum degree of the Barabási-Albert random tree, Combinator Probab Comput 14 (2005), 339-348.
35. K. Morris, A. Panholzer, and H. Prodinger, On some parameters in heap ordered trees, Combinator Probab Comp 13 (2004), 677-696.
36. M. E. J. Newman, The structure and function of complex networks, SIAM Rev 45 (2003), 167-256.
37. A. Panholzer, The climbing depth of random trees, Random Struct Algor 26 (2005), 84-109.
38. A. Panholzer and H. Prodinger, Analysis of some statistics for increasing tree families, Discrete Math Theoret Comp Sci 6 (2004), 437-460.
39. B. Pittel, Note on the heights of random recursive trees and random m-ary search trees, Random Struct Algor 5 (1994), 337-347.
40. H. Prodinger, Depth and path length of heap ordered trees, Int J Found Comp Sci 7 (1996), 293-299.
41. H. Prodinger, Descendants in heap ordered trees, or, a triumph of computer algebra, Electron J Combinator 3 (1996) Research Paper 29, 9 pages.
42. H. Prodinger and F. J. Urbanek, On monotone functions of tree structures, Discrete Appl Math 5 (1983), 223-239.
43. R. T. Smythe and H. M. Mahmoud, A survey of recursive trees, Theor Probab Math Statist 51 (1995), 1-27.
44. V. E. Stepanov, The distribution of the number of vertices in the layers of a random tree, Theor Probab Appl 14 (1969), 65-78.
45. G. Szabó, M. Alava, and J. Kertész, Shortest paths and load scaling in scale-free trees, Phys Rev E 66 (2002) Article 026101 (8 pages).
46. J. Szymanski, "On a nonuniform random recursive tree," In Random Graphs '85 (Poznań, 1985), North-Holland Mathematics Studies, 144, Amsterdam, North-Holland, pp. 297-306.
47. J. Szymański, Concentration of vertex degrees in a scale-free random graph process, Random Struct Algor 26 (2005), 224-236.
48. L. Takács, On the distribution of the number of vertices in layers of random trees, J Appl Math Stoch Anal 4 (1991), 175-186.