A functional limit theorem for the profile of search trees

Annals of Applied Probability

Volumn 18, Issue 1, 2008, Pages 288-333

  Drmota, Michael ^a,b   Janson, Svante ^a   Neininger, Ralph ^a,c  

^a UPPSALA UNIVERSITY   (Sweden)

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

^c GOETHE UNIVERSITY   (Germany)

Author keywords

Analysis of algorithms; Functional limit theorem; Profile of trees; Random trees; Search trees

Indexed keywords

EID: 51349156960     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/07-AAP457     Document Type: Article

References (36)

1. BENTKUS, YU. V. and RACHKAUSKAS, A. (1984). Estimates for the distance between sums of independent random elements in Banach spaces. Teor. Veroyatnost. i Primenen. 29 49-64.
2. [English transl. Theory Probab. Appl. (1984) 50-65.] MR0739500
3. BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley, New York. MR0233396
4. BOUSQUET-MÉLOU, M. and JANSON, S. (2006). The density of the ISE and local limit laws for embedded trees. Ann. Appl. Probab. 16 1597-1632. MR2260075
5. CHAUVIN, B., DRMOTA, M. and JABBOUR- HATTAB, J. (2001). The profile of binary search trees. Ann. Appl. Probab. 11 1042-1062. MR1878289
6. CHAUVIN, B. and DRMOTA, M. (2006). The random multisection problem, travelling waves, and the distribution of the height of m-ary search trees. Algorithmica 46 299-327. MR2291958
7. CHAUVIN, B., KLEIN, T., MARCKERT, J.-F. and ROUAULT, A. (2005). Martingales and profile of binary search trees. Electron. J. Probab. 10 420-435. MR2147314
8. CHAUVIN, B. and ROUAULT, A. (2004). Connecting yule process, bisection and binary search trees via martingales. J.. Iranian Statistical Society 3 89-116.
9. CHERN, H.-H. and HWANG, H.-K. (2001). Transitional behaviors of the average cost of Quicksort with median-of-(2t + 1). Algorithmica 29 44-69. MR1887298
10. CHERN, H.-H., HWANG, H.-K. and TSAI, T.-H. (2002). An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms. J. Algorithms 44 177-225. MR1933199
11. DEVROYE, L. and HWANG, H.-K. (2006). Width and mode of the profile for some random trees of logarithmic height. Ann. Appl. Probab. 16 886-918. MR2244436
12. DRMOTA, M. and HWANG, H.-K. (2005). Profiles of random trees: Correlation and width of random recursive trees and binary search trees. Adv. in Appl. Probab. 37 321-341. MR2144556
13. DRMOTA, M. and HWANG, H.-K. (2005). Bimodality and phase transitions in the profile variance of random binary search trees. SLAM J. Discrete Math. 19 19-45. MR2178182
14. FLAJOLET, P. and ODLYZKO, A. (1990). Singularity analysis of generating functions. SIAM J. Discrete Math. 3 216-240. MR1039294
15. FLAJOLET, P. and SEDGEWICK, R. (2008). Analytic Combinatorics. Cambridge Univ. Press. To appear. Available at http://algo.inria.fr/flajolet/Publications/books.html.
16. FUCHS, M., HWANG, H.-K. and NEININGER, R. (2006). Profiles of random trees: Limit theorems for random recursive trees and binary search trees. Algorithmica 46 367-407. MR2291961
17. GINÉ, E. and LEÓN, J. R. (1980). On the central limit theorem in Hilbert space. Stochastica 4 43-71. MR0573725
18. HWANG, H.-K. (2007). Profiles of random trees: Plane-oriented recursive trees. Random Structures Algorithms 30 380-413. MR2309623
19. JACOD, J. and SHIRYAEV, A. N. (1987). Limit Theorems for Stochastic Processes. Springer, Berlin. MR0959133
20. JANSON, S. (1994). Orthogonal Decompositions and Functional Limit Theorems for Random Graph Statistics. Amer. Math. Soc., Providence, RI. MR1219708
21. JOHNSON, N. L. and KOTZ, S. (1977). Urn Models and Their Applications. Wiley, New York. MR0488211
22. KALLENBERG, O. (2002). Foundations of Modern Probability, 2nd ed. Springer, New York. MR1876169
23. KRANTZ, S. G. (1982). Function Theory of Several Complex Variables. Wiley, New York, 1982. MR0635928
24. LEDOUX, M. and TALAGRAND, M. (1991). Probability in Banach Spaces. Isoperimetry and Processes. Springer, Berlin. MR1102015
25. LINDVALL, T. (1973). Weak convergence of probability measures and random functions in the function space D(0, ∞). J. Appl. Probab. 10 109-121. MR0362429
26. LYNCH, W. (1965). More combinatorial problems on certain trees. Comput. J. 7 299-302. MR0172492
27. MAHMOUD, H. M. (1992). Evolution of Random Search Trees. Wiley, New York. MR1140708
28. NEININGER, R. and RÜSCHENDORF, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Probab. 14 378-418. MR2023025
29. RUDIN, W. (1991). Functional Analysis, 2nd ed. McGraw-Hill, New York. MR1157815
30. TRÈVES, F. (1967). Topological Vector Spaces, Distributions and Kernels. Academic Press, New York. MR0225131
31. ZOLOTAREV, V. M. (1977). Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces. Teor. Veroyatnost. i Primenen. 21 741-758.
32. [Erratum (1977) 22 901.
33. English transl. Theory Probab. Appl. (1976) 21 721-737;
34. (1977) 22 881.] MR0517338
35. ZOLOTAREV, V. M. (1977). Ideal metrics in the problem of approximating the distributions of sums of independent random variables. Teor. Veroyatnost. i Primenen. 22 (1977) 449-465.
36. [English transl. Theory Probab. Appl. (1977) 22 433-449.] MR0455066