The random multisection problem, travelling waves and the distribution of the height of m-ary search trees

Algorithmica (New York)

Volumn 46, Issue 3-4, 2006, Pages 299-327

  Chauvin, Brigitte ^a   Drmota, Michael ^b  

^a UNIVERSITÉ DE VERSAILLES SAINT QUENTIN EN YVELINES   (France)

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

Author keywords

Branching random walk; Height of search trees; Random multisection; Travelling wave

Indexed keywords

BRANCHING RANDOM WALKS; DISTRIBUTION FUNCTIONS; RANDOM MULTISECTION PROBLEMS; SEARCH TREES; TRAVELLING WAVES;

ALGEBRA; ASYMPTOTIC STABILITY; LAPLACE TRANSFORMS; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 33846857300     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0107-7     Document Type: Conference Paper

References (23)

1. M. Bachmann. Limit theorems for the minimal position in a branching random walk with independent logconcave displacements. Adv. Appl. Probab., 32:159-176, 2000.
2. J. Bertoin. Self-similar fragmentations. Ann. Inst. H. Poincaré Probab. Statist., 38(3):319-340, 2002.
3. J. D. Biggins. Chernoff's theorem in the branching random walk. J. Appl. Probab., 14:630-636, 1977.
4. J. D. Biggins and A. E. Kyprianou. Seneta-Heyde norming in the branching random walk. Ann. Probab., 25:337-360, 1997.
5. J. D. Biggins and A. E. Kyprianou. Measure change in multitype branching. Adv. Appl. Probab., 36:544-581, 2004.
6. J. D. Biggins and A. E. Kyprianou. The smoothing transform: the boundary case. Electronic J. In. Probab., 10:609-631, 2005.
7. M. Bramson. Convergence of solutions of the kolmogorov equation to travelling waves. Mem. Amer. Math. Soc., 44(285): 1-190, 1983.
8. B. Chauvin and A. Rouault. Connecting Yule process, bisection and binary search tree via martingales. JIRSS, 3:88-116, 2004.
9. L. Devroye. A note on the height of binary search trees. J. Assoc. Comput. Mach., 33:489-498, 1986.
10. L. Devroye. On the height of random m-ary search trees. Random Structures Algorithms, 1:191-203, 1990.
11. L. Devroye. Universal limit laws for depths in random trees. SIAM J. Comput., 28(2):409-432 (electronic), 1999.
12. M. Drmota. An analytic approach to the height of binary search trees, II. J. Assoc. Comput. Mach., 50:333-374, 2003.
13. R. Durrett and T. Liggett. Fixed points of the smoothing transformation. Z. Wahrsch. Verw. Gebiete, 64(3):275-301, 1983.
14. A. E. Kyprianou. Slow variation and uniqueness of solutions to the functional equation in the branching random walk. J. Appl. Probab., 35:795-801, 1998.
15. Q. Liu. Fixed points of a generalized smoothing transformation and applications to the branching random walk. Adv. Appl. Probab., 30:85-112, 1998.
16. H. M. Mahmoud. Evolution of Random Search Trees. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York, 1992.
17. S. N. Majumdar and P. L. Krapivsky. Traveling waves, front selection, and exact nontrivial exponents in a random fragmentation problem. Phys. Rev. Lett., 85:5492-5495, 2000.
18. S. N. Majumdar and P. L. Krapivsky. Extreme value statistics and traveling fronts: various applications. Phys. A, 318(1-2):161-170, 2003.
19. J.-F. Marckert, B. Chauvin, T. Klein and A. Rouault. Martingales and profile of binary search trees. Electronic J. In. Probab., 10:420-435, 2005.
20. C. McDiarmid. Minimal positions in a branching random walk. Ann. Appl. Probab., 5(1):128-139, 1995.
21. B. Pittel. On growing random binary trees. J. Math. Anal. Appl., 103:461-480, 1984.
22. B. Reed. The height of a random binary search tree. J. Assoc. Comput. Mach., 50:306-332, 2003.
23. J. M. Robson. The height of binary search trees. Austral. Comput. J., 11:151-153, 1979.