Profiles of random trees: Limit theorems for random recursive trees and binary search trees

Algorithmica (New York)

Volumn 46, Issue 3-4, 2006, Pages 367-407

  Fuchs, Michael ^a   Hwang, Hsien Kuei ^b   Neininger, Ralph ^c  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

^c GOETHE UNIVERSITY   (Germany)

Author keywords

Probabilistic analysis of algorithms; Profile of trees; Random binary search tree; Random recursive tree; Weak convergence

Indexed keywords

PROBABILISTIC ANALYSIS; RANDOM BINARY SEARCH TREES; RANDOM RECURSIVE TREES; WEAK CONVERGENCE;

ALGORITHMS; ASYMPTOTIC STABILITY; METHOD OF MOMENTS; PROBABILITY; RANDOM PROCESSES; RECURSIVE FUNCTIONS; THEOREM PROVING;

TREES (MATHEMATICS);

EID: 33846883721     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0109-5     Document Type: Conference Paper

References (51)

1. D. Aldous (1991). The continuum random tree. II. An overview. In Stochastic Analysis (Durham, 1990), pp. 23-70. London Mathematical Society Lecture Note Series, 167. Cambridge University Press, Cambridge.
2. D. Aldous and P. Shields (1988). A diffusion limit for a class of randomly-growing binary trees. Probability Theory and Related Fields 79:509-542.
3. F. Bergeron, P. Flajolet and B. Salvy (1992). Varieties of increasing trees. In CAAP '92 (Rennes, 1992), pp. 24-48. Lecture Notes in Computer Science, 581. Springer, Berlin.
4. Y. C. Chan, B. D. Hughes, A. S. Leong and W. J. Reed (2003). Stochastically evolving networks. Physical Review E 68:06624-1- 06624-24.
5. B. Chauvin, M. Drmota and J. Jabbour-Hattab (2001). The profile of binary search trees. Annals of Applied Probability 11:1042-1062.
6. B. Chauvin, T. Klein, J.-F. Marckert and A. Rouault (2005). Martingales and profile of binary search trees. Electronic Journal of Probability 10:420-435.
7. B. Chauvin and A. Rouault (2004). Connecting Yule process, bisection and binary search tree via martingales. Journal of the Iranian Statistical Society 3:88-116.
8. H.-H. Chern and H.-K. Hwang (2001a). Phase changes in random m-ary search trees and generalized quicksort. Random Structures and Algorithms 19:316-358.
9. H.-H. Chern and H.-K. Hwang (2001b). Transitional behaviors of the average cost of quicksort with median-of-(2t+1). Algorithmica 29:44-69.
10. H.-H. Chern, H.-K. Hwang and T.-H. Tsai (2002). An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms. Journal of Algorithms 44:177-225.
11. Devroye (1987). Branching processes in the analysis of the heights of trees. Acta Informatica 24:277-298.
12. Devroye (1998). Universal limit laws for depths in random trees. SIAM Journal on Computing 28:409-432.
13. Devroye and J. M. Robson (1995). On the generation of random binary search trees. SIAM Journal on Computing 24:1141-1156.
14. Devroye, C. McDiarmid and B. Reed (2002). Giant components for two expanding graph processes. In Mathematics and Computer Science, II (Versailles, 2002), pp. 161-173. Birkhäuser, Basel.
15. R. P. Dobrow and J. A. Fill (1999). Total path length for random recursive trees. Combinatorics, Probability and Computing 8:317-333.
16. Dondajewski and J. Szymanski (1982). On the distribution of vertex-degrees in a strata of a random recursive tree. Bulletin de l'Académie Polonaise des Sciences. Série des Sciences Mathématiques 30:205-209.
17. Drmota and B. Gittenberger (1997). On the profile of random trees. Random Structures and Algorithms 10:421-451.
18. Drmota and H.-K. Hwang (2005a). Bimodality and phase transitions in the profile variance of random binary search trees. SIAM Journal on Discrete Mathematics 19:19-45.
19. Drmota and H.-K. Hwang (2005b). Profiles of random trees: correlation and width of random recursive trees and binary search trees. Advances in Applied Probability 37:321-341.
20. P. Erdo″s and P. Turán (1967). On some problems of a statistical group-theory. III. Acta Mathematica Academiae Scientiarum Hungaricae 18:309-320.
21. J. Evans and R. C. Dunbar (1982). The parallel quicksort algorithm. I. Run time analysis. International Journal of Computer Mathematics 12:19-55.
22. P. Flajolet and A.M. Odlyzko (1990). Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3:216-240.
23. J. L. Gastwirth and P. K. Bhattacharya (1984). Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable. Operations Research 32:527-536.
24. R. Grossman and R. G. Larson (1989). Hopf-algebraic structure of families of trees. Journal of Algebra 126:184-210.
25. H.-K. Hwang (1995). Asymptotic expansions for the Stirling numbers of the first kind. Journal of Combinatorial Theory, Series A 71:343-351.
26. H.-K. Hwang (2005). Profiles of random trees: plane-oriented recursive trees. Preprint submitted for publication.
27. H.-K. Hwang and R. Neininger (2002). Phase change of limit laws in the quicksort recurrence under varying toll functions. SIAM Journal on Computing 31:1687-1722.
28. P. Jacquet, W. Szpankowski and J. Tang (2001). Average profile of the Lempel-Ziv parsing scheme for a Markovian source. Algorithmica 31:318-360.
29. Janic, F. Kuipers, X. Zhou and P. van Mieghem (2002). Implications for QoS provisioning based on traceroute measurements. In Proceedings of the 3rd International Workshop on Quality of Future Internet Services, QofIS 2002, Zurich, Switzerland, pp. 3-14. Lecture Notes in Computer Science, 2511. Springer, Berlin.
30. G. Kersting (1998). On the height profile of a conditioned Galton-Watson tree. Preprint.
31. E. Knuth (1997). The Art of Computer Programming, Volume 1, Fundamental Algorithms, second edition. Addison-Wesley, Reading, MA.
32. H. M. Mahmoud (1991). Limiting distributions for path lengths in recursive trees. Probability in the Engineering and Informational Sciences 5:53-59.
33. H. M. Mahmoud and R. T. Smythe (1995). Probabilistic analysis of bucket recursive trees. Theoretical Computer Science 144:221-249.
34. A. Meir and J. W. Moon (1974). Cutting down recursive trees. Mathematical Biosciences 21:173-181.
35. A. Meir and J. W. Moon (1978). On the altitude of nodes in random trees. Canadian Journal of Mathematics 30:997-1015.
36. J. W. Moon (1974). The distance between nodes in recursive trees. In Combinatorics (edited by T. P. McDonough and V. C. Marron), pp. 125-132. London Mathematical Society Lecture Note Series, 13. Cambridge University Press, Cambridge.
37. H. S. Na and A. Rapoport (1970). Distribution of nodes of a tree by degree. Mathematical Biosciences 6:313-329.
38. Najock and C. C. Heyde (1982). On the number of terminal vertices in certain random trees with an application to stemma construction in philology. Journal of Applied Probability 19:675-680.
39. R. Neininger and L. Rüschendorf (2004). A general limit theorem for recursive algorithms and combinatorial structures. Annals of Applied Probability 14:378-418.
40. V. Petrov (1975). Sums of Independent Random Variables. Springer-Verlag, Heidelberg. Translated from the Russian by A. A. Brown.
41. J. Pitman (1999). The SDE solved by local times of a Brownian excursion or bridge derived from the height profile of a random tree or forest. Annals of Probability 27:261-283.
42. B. Pittel (1994). Note on the heights of random recursive trees and random m-ary search trees. Random Structures and Algorithms 5:337-347.
43. S. T. Rachev (1991). Probability Metrics and the Stability of Stochastic Models. Wiley, Chichester.
44. U. Rösler and L. Rüschendorf (2001). The contraction method for recursive algorithms. Algorithmica 29:3-33.
45. R. T. Smythe and H. M. Mahmoud (1995). A survey of recursive trees. Theory of Probability and Mathematical Statistics 51:1-27.
46. J. Szymański (1990). On the maximum degree and the height of a random recursive tree. In Random Graphs '87 (Poznań, 1987), pp. 313-324. Wiley, Chichester.
47. G. T. Tetzlaff (2002). Breakage and restoration in recursive trees. Journal of Applied Probability 39:383-390.
48. P. van Mieghem, G. Hooghiemstra and R. van der Hofstad (2001). On the efficiency of multicast. IEEE/ACM Transactions on Networking 9:719-732.
49. R. van der Hofstad, G. Hooghiemstra and P. van Mieghem (2002). On the covariance of the level sizes in random recursive trees. Random Structures and Algorithms 20:519-539.
50. M. Zolotarev (1976). Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces. Theory of Probability and its Applications 21:721-737.
51. V. M. Zolotarev (1977). Ideal metrics in the problem of approximating distributions of sums of independent random variables. Theory of Probability and its Applications 22:433-449.