Profiles of random trees: Correlation and width of random recursive trees and binary search trees

Advances in Applied Probability

Volumn 37, Issue 2, 2005, Pages 321-341

  Drmota, Michael ^a   Hwang, Hsien Kuei ^b  

^a INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE   (Austria)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Correlation coefficient; Random binary search tree; Random recursive tree; Sign change; Total path length; Width

Indexed keywords

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; CORRELATION METHODS; POLYNOMIALS; PROBABILITY; TREES (MATHEMATICS);

CORRELATION COEFFICIENT; RANDOM BINARY SEARCH TREE; RANDOM RECURSIVE TREE; TOTAL PATH LENGTH;

RANDOM PROCESSES;

EID: 22244487665     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1118858628     Document Type: Article

References (27)

1. Arya, S., Golin, M. J. and Mehlhorn, K. (1999). On the expected depth of random circuits. Combinatorics Prob. Comput. 8, 209-228.
2. Billingsley, P. (1968). Convergence of Probability Measures. John Wiley, New York.
3. Booth, A. D. and Colin, J. T. (1960). On the efficiency of a new method of dictionary construction. Inf. Control 3, 327-334.
4. Brown, G. G. and Shubert, B. O. (1984). On random binary trees. Math. Operat. Res. 9, 43-65.
5. Chauvin, B., Drmota, M. and Jabbour-Hattab, J. (2001). The profile of binary search trees. Ann. Appl. Prob. 11, 1042-1062.
6. Dobrow, R. P. and Fill, J. A. (1999). Total path length for random recursive trees. Combinatorics Prob. Comput. 8, 317-333.
7. Drmota, M. and Hwang, H.-K. (2005). Bimodality and phase transitions in the profile variance of random binary search trees. To appear in SIAM J. Discrete Math.
8. Flajolet, P. and Odlyzko, A. M. (1990). Singularity analysis of generating functions. SIAM J. Discrete Math. 3, 216-240.
9. Françon, J. (1977). On the analysis of algorithms for trees. Theoret. Comput. Sci. 4, 155-169.
10. Fuchs, M., Hwang, H.-K. and Neininger, R. (2005). Profiles of random trees: limit theorems for random recursive trees and binary search trees. Submitted. Available at http://algo.stat.sinica.edu.tw/.
11. Gastwirth, J. L. (1977). A probability model of a pyramid scheme. Amer. Statistician 31, 79-82.
12. Grossman, R. and Larson, R. G. (1989). Hopf-algebraic structure of families of trees. J. Algebra 126, 184-210.
13. Hall, P. and Heyde, C. C. (1980). Martingale Limit Theory and Its Application. Probability and Mathematical Statistics. Academic Press, New York.
14. Hibbard, T. N. (1962). Some combinatorial properties of certain trees with applications to searching and sorting. J. Assoc. Comput. Mach. 9, 13-28.
15. Hwang, H.-K. (1995). Asymptotic expansions for the Stirling numbers of the first kind. J. Combinatorial Theory A 71, 343-351.
16. Hwang, H.-K. (1997). Asymptotic estimates for elementary probability distributions. Studies Appl. Math. 99, 393-417.
17. Knuth, D. E. (1997). The Art of Computer Programming, Vol. 3, Sorting and Searching, 2nd edn. Addison-Wesley, Reading, MA.
18. Lynch, W. C. (1965). More combinatorial properties of certain trees. Comput. J. 7, 299-302.
19. Mahmoud, H. M. (1991). Limiting distributions for path lengths in recursive trees. Prob. Eng. Inf. Sci. 5, 53-59.
20. Mahmoud, H. M. (1992). Evolution of Random Search Trees. John Wiley, New York.
21. Meir, A. and Moon, J. W. (1974). Cutting down recursive trees. Math. Biosci. 21, 173-181.
22. Mitchell, S. L., Cockayne, E. J. and Hedetniemi, S. T. (1979). Linear algorithms on recursive representations of trees. J. Comput. System Sci. 18, 76-85.
23. Moon, J. W. (1974). The distance between nodes in recursive trees. In Combinatorics (London Math. Soc. Lecture Notes Ser. 13), eds T. P. McDonough and V. C. Marron, Cambridge University Press, pp. 125-132.
24. Na, H. S. and Rapoport, A. (1970). Distribution of nodes of a tree by degree. Math. Biosci. 6, 313-329.
25. Tapia, M. A. and Myers, B. R. (1967). Generation of concave node-weighted trees. IEEE Trans. Circuits Systems 14, 229-230.
26. Van der Hofstad, R., Hooghiemstra, G. and van Mieghem, P. (2002). On the covariance of the level sizes in random reeursive trees. Random Structures Algorithms 20, 519-539.
27. Windley, P. F. (1960). Trees, forests and rearranging. Comput. J. 3, 84-88.