Random cutting and records in deterministic and random trees

Random Structures and Algorithms

Volumn 29, Issue 2, 2006, Pages 139-179

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748429419     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20086     Document Type: Article

References (38)

1. D. Aldous, The continuum random tree II: An overview, Stochastic Analysis (Proc., Durham, 1990), London Math. Soc. Lecture Note Ser. 167, Cambridge Univ. Press, Cambridge, 1991, pp. 23-70.
2. D. Aldous, The continuum random tree III, Ann Probab 21 (1) (1993), 248-289.
3. D. Aldous, Brownian excursion conditioned on its local time, Electron Comm Probab 3(1998), 79-90.
4. A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Oxford University Press, Oxford, 1992.
5. P. Biane, J. Pitman, and M. Yor, Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions, Bull Am Math Soc (NS) 38(4) (2001), 435-465.
6. P. Biane and M. Yor, Valeurs principales associées aux temps locaux browniens, Bull Sci Math 111 (1) (1987), 23-101.
7. P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968.
8. R. M. Blumenthal, Excursions of Markov Processes, Birkhäuser, Boston, 1992.
9. P. Chassaing and R. Marchand. In preparation.
10. P. Chassaing, J. F. Marckert, and M. Yor, The height and width of simple trees, Mathematics and Computer Science (Versailles, 2000), Trends Math., Birkhäuser, Basel, 2000, pp. 17-30.
11. K. L. Chung, Excursions in Brownian motion, Ark Mat 14(2) (1976), 155-177.
12. L. Devroye, Branching processes and their applications in the analysis of tree structures and tree algorithms. In Probabilistic methods for algorithmic discrete mathematics, M. Habib et al. (editors), Algorithms Combin. 16, Springer-Verlag, Berlin, 1998, pp. 249-314.
13. L. Devroye and R. Neininger, Distances and finger search in random binary search trees, SIAM J Comput 33(3) (2004), 647-658.
14. s≤1 r(s), Stud Sci Math Hungar 37(1-2) (2001), 131-144.
15. M. Drmota and B. Gittenberger, On the profile of random trees, Random Struct Algor 10(4) (1997), 421-451.
16. P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, J Comp Sys Sci 25 (1982), 171-213.
17. P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J Discrete Math 3 (2) (1990), 216-240.
18. R. Grübel and N. Stefanoski, Mixed Poisson approximation of node depth distributions in random binary search trees, Ann Appl Probab 15(1A) (2005), 279-297.
19. A. Gut, Probability: A Graduate Course, Springer-Verlag, New York, 2005.
20. S. Janson, Random records and cuttings in complete binary trees. In Mathematics and Computer Science III, Algorithms, Trees, Combinatorics and Probabilities (Vienna 2004), Eds. M. Drmota, P. Flajolet, D. Gardy, and B. Gittenberger (editors), Birkhäuser, Basel, 2004, pp. 241-253.
21. T. Jeulin, Semi-martingales et grossissement d'une filtration. Lecture Notes in Mathematics 833, Springer-Verlag, Berlin, 1980.
22. W. D. Kaigh, An invariance principle for random walk conditioned by a late return to zero, Ann Probab 4(1) (1976), 115-121.
23. O. Kallenberg, Foundations of Modern Probability, 2nd ed., Springer-Verlag, New York, 2002.
24. D. P. Kennedy, The distribution of the maximum Brownian excursion, J Appl Probab 13(2) (1976), 371-376.
25. D. E. Knuth, The Art of Computer Programming. Vol. 3: Sorting and Searching, 2nd ed., Addison-Wesley, Reading, MA, 1998
26. V. F. Kolchin, Random Mappings, Optimization Software, New York, 1986.
27. R. Lyons, R. Pemantle, and Y. Peres, A conceptual proof of the Kesten-Stigum theorem, Ann Probab 23 (1995), 1125-1138.
28. M. Luczak and P. Winkler, Building uniform subtrees, Random Struct Algor 24(4) (2004), 420-443.
29. J.-F. Marckert and A. Mokkadem, The depth first processes of Galton-Watson trees converge to the same Brownian excursion, Ann Probab 31(3) (2003), 1655-1678.
30. J.-F. Marckert and A. Panholzer, Noncrossing trees are almost conditioned Galton-Watson trees, Random Struct Algor 20(1) (2002), 115-125.
31. A. Meir and J. W. Moon, Cutting down random trees, J Australian Math Soc 11 (1970), 313-324.
32. A. Meir and J. W. Moon, On the altitude of nodes in random trees, Can J Math 30 (1978), 997-1015.
33. A. Panholzer, Cutting down very simple trees, Preprint, 2003.
34. A. Panholzer, Non-crossing trees revisited: cutting down and spanning subtrees, Proceedings, Discrete Random Walks 2003, C. Banderier and C. Krattenthaler (editors), Discr Math Theor Comput Sci AC, 2003, pp. 265-276.
35. J. Pitman, Combinatorial Stochastic Processes, Lecture Notes for St. Flour Summer School, July 2002. Preprint, available from http://stat-www. berkeley.edu/users/pitman/bibliog.html
36. A. Rényi, (1962). On the extreme elements of observations, MTA III, Oszt. Közl. 12 (1962), 105-121.
37. Reprinted in Collected Works, Vol III, Akadémiai Kiadó, Budapest, 1976, pp. 50-66.
38. D. Revuz and M. Yor, Continuous Martingales and Brownian Motion, 3rd ed., Springer-Verlag, Berlin, 1999.