Distribution of distances in random binary search trees

Annals of Applied Probability

Volumn 13, Issue 1, 2003, Pages 253-276

  Mahmoud, Hosam M ^a   Neininger, Ralph ^b  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Contraction method; Fixed point equation; Metric space; Random trees; Recurrence; Weak convergence; Zolotarev metric

Indexed keywords

EID: 0037274512     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1042765668     Document Type: Article

References (23)

1. CRAMER, M. and RÜSCHENDORF, L. (1996). Analysis of recursive algorithms by the contraction method. Athens Conference on Applied Probability and Time Series Analysis. Lecture Notes in Statist. 114 18-33. Springer, New York.
2. DEVROYE, L. (1988). Applications of the theory of records in the study of random trees. Acta Inform. 26 123-130.
3. DEVROYE, L. (1999). Universal limit laws for depths in random trees. SIAM J. Comput. 28 409-432.
4. GUTMAN, I. and POLANSKY, O. (1986). Mathematical Concepts in Organic Chemistry. Springer, Berlin.
5. HWANG, H.-K. and NEININGER, R. (2002). Phase change of limit laws in the quicksort recurrence under varying toll functions. SIAM J. Comput. 31 1687-1722.
6. KEMP, R. (1984). Fundamentals of the Average Case Analysis of Particular Algorithms. Wiley, New York.
7. KNUTH, D. (1998). The Art of Computer Programming 3. Sorting and Searching, 2nd ed. Addison-Wesley, Reading, MA.
8. MAHMOUD, H. (1992). Evolution of Random Search Trees. Wiley, New York.
9. MAHMOUD, H. (2000). Sorting: A Distribution Theory. Wiley, New York.
10. MAHMOUD, H. and SMYTHE, R. (1998). Probabilistic analysis of MULTIPLE QUICK SELECT. Algorithmica 22 569-584.
11. NEININGER, R. (2001). On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Structures Algorithms 19 498-524.
12. NEININGER, R. (2002). The Wiener index of random trees. Combin. Probab. Comput. To appear.
13. NEININGER, R. and RÜSCHENDORF, L. (2002a). Rates of convergence for Quicksort. J. Algorithms. To appear.
14. NEININGER, R. and RÜSCHENDORF, L. (2002b). A general contraction theorem and asymptotic normality in combinatorial structures. Technical Report 01-25, Univ. Freiburg.
15. RACHEV, S. (1991). Probability Metrics and the Stability of Stochastic Models. Wiley, New York.
16. RACHEV, S. and RÜSCHENDORF, L. (1995). Probability metrics and recursive algorithms. Adv. in Appl. Probab. 27 770-799.
17. RÖSLER, U. (1991). A limit theorem for "Quicksort." RAIRO Inform. Théor. Appl. 25 85-100.
18. RÖSLER, U. (1992). A fixed point theorem for distributions. Stochastic Process. Appl. 42 195-214.
19. RÖSLER, U. (2001). On the analysis of stochastic divide and conquer algorithms. Algorithmica 29 238-261.
20. RÖSLER, U. and RÜSCHENDORF, L. (2001). The contraction method for recursive algorithms. Algorithmica 29 3-33.
21. SEIDEL, R. and ARAGON, C. R. (1996). Randomized search trees. Algorithmica 16 464-497.
22. TRINAJSTIĆ, N. (1992). Chemical Graph Theory. CRC Press, Boca Raton, FL.
23. ZOLOTAREV, V. M. (1976). Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces. Theory Probab. Appl. 21 721-737.