Width and mode of the profile for some random trees of logarithmic height

Annals of Applied Probability

Volumn 16, Issue 2, 2006, Pages 886-918

  Devroye, Luc ^a   Hwang, Hsien Kuei ^a,b  

^a MCGILL UNIVERSITY   (Canada)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Central moments; Profile; Random recursive trees; Random search trees; Width

Indexed keywords

EID: 33746925676     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051606000000187     Document Type: Article

References (46)

1. ALDOUS, D. (1991). The continuum random tree. II. An overview. In Stochastic Analysis (M.T. Barlow and N.H. Binghan, eds.) 23-70. Cambridge Univ. Press. MR1166406
2. BERGERON, F., FLAJOLET, P. and SALVY, B. (1992). Varieties of increasing trees. CAAP'92 (Rennes, 1992) 24-48. Lecture Notes in Comput. Sci. 581. Springer, Berlin. MR1251994
3. CHAUVIN, B., DRMOTA, M. and JABBOUR-HATTAB, J. (2001). The profile of binary search trees. Ann. Appl. Probab. 11 1042-1062. MR1878289
4. CHERN, H.-H., FUCHS, M. and HWANG, H.-K. (2005). Phase changes in random point quadtrees. Unpublished manuscript. Available at algo.stat.sinica.edu.tw/ HK.
5. CHERN, H.-H. and HWANG, H.-K. (2001). Phase changes in random m-ary search trees and generalized quicksort. Random Structures Algorithms 19 316-358. MR 1871558
6. 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. MR 1887298
7. CHERN, H.-H., HWANG, H.-K. and TSAI, T.-H. (2003). An asymptotic theory for CauchyEuler differential equations with applications to the analysis of algorithms. J. Algorithms 44 177-225. MR 1933199
8. DEVROYE, L. (1998). Universal limit laws for depths in random trees. SIAM J. Comput. 28 409-132. MR 1634354
9. DEVROYE, L. and LAFOREST, L. (1990). An analysis of random rf-dimensional quad trees. SIAM J. Comput. 19 821-832. MR 1059656
10. DONDAJEWSKI, M. and SZYMANSKI. J. (1982). On the distribution of vertex-degrees in a strata of a random recursive tree. Bull. Acad. Polon. Sci. Ser. Sci. Math. 30 205-209. MR0673253
11. DRMOTA, M. and GITTENBERGER, B. (2004). The width of Galton-Watson trees conditioned by the size. Discrete Math. Theor. Comput. Sci. 6 387400. MR2081482
12. DRMOTA, M. and HWANG, H.-K. (2005). Bimodality and phase transitions in the profile variance of random binary search trees. SIAM J. Discrete Math. 19 19-45. MR2178182
13. 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
14. ERDÓS, P. (1953). On a conjecture of Hammersley. J. London Math. Soc. 28 232-236. MR0053142
15. FINKEL, R. A. and BENTLEY, R. A. (1974). Quadtrees: A data structure for retrieval on composite keys. Acta Informatisa 4 1-9.
16. [16| FLAJOLET, P., GONNET, G., PUECH, C. and ROBSON, J. M. (1991). The analysis of multidimensional searching in quad-trees. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco. CA, 1991) 100-109. ACM, New York. MR1095824
17. FLAJOLET, P., GONNET, G., PUECH, C. and ROBSON, J. M. (1993). Analytic variations on quadtrees. Algorithmica 10 473-500. MR 1244619
18. FLAJOLET, P., LABELLE, G., LAFOREST, L. and SALVY, B. (1995). Hypergeometrics and the cost structure of quadtrees. Random Structures Algorithms 7 117-114. MR 1369059
19. FLAJOLET, P. and ODLYZKO, A. M. (1990). Singularity analysis of generating functions. SIAM J. Discrete Math. 3 216-240. MR1039294
20. FLAJOLET, P. and SEDGEWICK, R. (2006). Analytic Combinatorics. To appear.
21. FUCHS, M., HWANG, H.-K. and NEININGER, R. (2005). Profiles of random trees: Limit theorems for random recursive trees and binary search trees. Algorithmica. To appear. Available at algo.stat.sinica.edu.tw/HK.
22. HAMMERSLEY, J. M. (1951). The sum of products of the natural numbers. Proc. London Math. Soc. 1435-452. MR0046377
23. HENNEQUIN, P. (1991). Analyse en moyenne d'algorithme, tri rapide et arbres de recherche. Ph.D. thesis, LIX, École Polytechnique.
24. HWANG, H.-K. (1994). Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques. Ph.D. thesis, LIX, École Polytechnique.
25. HWANG, H.-K. (1995). Asymptotic expansions for the Stirling numbers of the first kind. J. Combin. Theory Ser. A 71 343-351. MR 1342456
26. HWANG, H.-K. (2005). Profiles of random trees: Plane-oriented recursive trees. Unpublished manuscript. Available at algo.stat.sinica.edu.tw/HK.
27. JABBOUR-HATTAB, J. (2001). Martingales and large deviations for binary search trees. Random Structures Algorithms 19 112-127. MR1848787
28. KNUTH, D. E. (1998). The Art of Computer Programming. III. Sorting and Searching, 2nd ed. Addison-Wesley, Reading, MA. MR0378456
29. LOÈVE, M. (1977). Probability Theory. I, 4th ed. Springer, New York. MR0651017
30. LYNCH, W. C. (1965). More combinatorial properties of certain trees. Comput. J. 7 299-302. MR0172492
31. MAHMOUD, H. M. (1992). Distances in random plane-oriented recursive trees. J. Comput. Appl. Math. 41237-245. MR1181723
32. MAHMOUD, H. M. (1992). Evolution of Random Search Trees. Wiley, New York. MR1140708
33. MAHMOUD, H. M. and PITTEL, B. (1984). On the joint distribution of the insertion path length and the number of comparisons in search trees. Discrete Appl. Math. 20 243-251. MR0944124
34. MAHMOUD, H. M. and PITTEL, B. (1988). On the most probable shape of a search tree grown from a random permutation. SIAM J. Algebraic Discrete Methods 5 69-81. MR0731858
35. MEIR, A. and MOON, J. W. (1974). Cutting down recursive trees. Math. Biosci. 21 173-181.
36. MEIR, A. and MOON, J. W. (1978). On the altitude of nodes in random trees. Canad. J. Math. 30 997-1015. MR0506256
37. MOON, J. W. (1974). The distance between nodes in recursive trees. In Combinatorics (T. P. McDonough and V. C. Marron, eds.) 125-132. Cambridge Univ. Press, London. MR0357186
38. MUNTZ, R. and UZGALIS, R. (1971). Dynamic storage allocation for binary search trees in a two-level memory. In Proceedings of the Princeton Conference on Information Sciences and Systems 4 345-349.
39. PRODINGER, H. (1996). Depth and path length of heap ordered trees. Internat. J. Found. Comput. Sci. 7 293-299.
40. PRODINGER, H. and URBANEK, F. J. (1983). On monotone functions of tree structures. Discrete Appl. Math. 5 223-239. MR0683514
41. SAMET, H. (1990). The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
42. SEDGEWICK, R. (1983). Mathematical analysis of combinatorial algorithms. In Probability Theory and Computer Science (G. Louchard and G. Latouche, eds.) 123-205. Academic Press, London. MR0753477
43. SMYTHE, R. T. and MAHMOUD, H. M. (1995). A survey of recursive trees. Theory Probab. Math. Statist. 51 1-27. MR1445048
44. SZYMANSKI, J. (1987). On a nonuniform random recursive tree. In Random Graphs'85 (Poznań, 1985) 297-306. North-Holland, Amsterdam. MR0930497
45. TAPIA, M. A. and MYERS, B. R. (1967). Generation of concave node-weighted trees. IEEE Trans. Circuits Systems 14 229-230. MR0274335
46. TEMME, N. M. (1993). Asymptotic estimates of Stirling numbers. Stud. Appl. Math. 89 233-243. MR 1223774