On the silhouette of binary search trees
Rudolf Grübel
Source: Ann. Appl. Probab. Volume 19, Number 5 (2009), 1781-1802.
Abstract
A zero-one sequence describes a path through a rooted directed binary tree T; it also encodes a real number in [0, 1]. We regard the level of the external node of T along the path as a function on the unit interval, the silhouette of T. We investigate the asymptotic behavior of the resulting stochastic processes for sequences of trees that are generated by the binary search tree algorithm.
Primary Subjects: 60F17
Secondary Subjects: 05C05, 68W05
Keywords: Analysis of algorithms; contraction method; convergence in distribution; external path length; functional limit theorems
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.aoap/1255699543
Digital Object Identifier: doi:10.1214/08-AAP593
References
Aldous, D. (1991). The continuum random tree. II. An overview. In Stochastic Analysis (Durham, 1990). London Mathematical Society Lecture Note Series 167 23–70. Cambridge Univ. Press, Cambridge.
Mathematical Reviews (MathSciNet):
MR1166406
Zentralblatt MATH:
0791.60008
Biggins, J. D. (1997). How fast does a general branching random walk spread? In Classical and Modern Branching Processes (Minneapolis, MN, 1994). IMA Vol. Math. Appl. 84 19–39. Springer, New York.
Mathematical Reviews (MathSciNet):
MR1601689
Zentralblatt MATH:
0873.60061
Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
Mathematical Reviews (MathSciNet):
MR233396
Chauvin, B., Drmota, M. and Jabbour-Hattab, J. (2001). The profile of binary search trees. Ann. Appl. Probab. 11 1042–1062.
Mathematical Reviews (MathSciNet):
MR1878289
Zentralblatt MATH:
1012.60038
Digital Object Identifier: doi:10.1214/aoap/1015345394
Project Euclid: euclid.aoap/1015345394
Cramer, M. (1996). A note concerning the limit distribution of the quicksort algorithm. RAIRO Inform. Théor. Appl. 30 195–207.
Mathematical Reviews (MathSciNet):
MR1415828
Dennert, F. and Grübel, R. (2007). Renewals for exponentially increasing lifetimes, with an application to digital search trees. Ann. Appl. Probab. 17 676–687.
Devroye, L. (1986). A note on the height of binary search trees. J. Assoc. Comput. Mach. 33 489–498.
Mathematical Reviews (MathSciNet):
MR849025
Zentralblatt MATH:
0741.05062
Digital Object Identifier: doi:10.1145/5925.5930
Devroye, L., Fill, J. A. and Neininger, R. (2000). Perfect simulation from the Quicksort limit distribution. Electron. Comm. Probab. 5 95–99 (electronic).
Mathematical Reviews (MathSciNet):
MR1781844
Zentralblatt MATH:
0958.65012
Fill, J. A. and Janson, S. (2000). Smoothness and decay properties of the limiting Quicksort density function. In Mathematics and Computer Science (Versailles, 2000) 53–64. Birkhäuser, Basel.
Mathematical Reviews (MathSciNet):
MR1798287
Zentralblatt MATH:
0967.68180
Grübel, R. (2005). A hooray for Poisson approximation. In 2005 International Conference on Analysis of Algorithms. Discrete Math. Theor. Comput. Sci. Proc. AD 181–191 (electronic). Assoc. Discrete Math. Theor. Comput. Sci., Nancy.
Grübel, R. and Rösler, U. (1996). Asymptotic distribution theory for Hoare’s selection algorithm. Adv. in Applied Prob. 28 252–269.
Kallenberg, O. (1997). Foundations of Modern Probability. Springer, New York.
Mathematical Reviews (MathSciNet):
MR1464694
Knuth, D. E. (1973). The Art of Computer Programming. Volume 3. Addison-Wesley, Reading, MA.
Knuth, D. E. (1975). The Art of Computer Programming, Volume 1, 3nd ed. Addison-Wesley, Reading, MA.
Mathematical Reviews (MathSciNet):
MR378456
Le Gall, J.-F. (1999). Spatial Branching Processes, Random Snakes and Partial Differential Equations. Birkhäuser, Basel.
Mathematical Reviews (MathSciNet):
MR1714707
Zentralblatt MATH:
0938.60003
Luczak, M. and Winkler, P. (2004). Building uniformly random subtrees. Random Structures Algorithms 24 420–443.
Mathematical Reviews (MathSciNet):
MR2060629
Mahmoud, H. M. (1992). Evolution of Random Search Trees. Wiley, New York.
Mathematical Reviews (MathSciNet):
MR1140708
Zentralblatt MATH:
0762.68033
Neininger, R. and Rüschendorf, L. (2006). A survey of multivariate aspects of the contraction method. Discrete Math. Theor. Comput. Sci. 8 31–56 (electronic).
Pitman, J. (2006). Combinatorial Stochastic Processes. Lecture Notes in Math. 1875. Springer, Berlin.
Mathematical Reviews (MathSciNet):
MR2245368
Zentralblatt MATH:
1103.60004
Pittel, B. (1985). Asymptotical growth of a class of random trees. Ann. Probab. 13 414–427.
Mathematical Reviews (MathSciNet):
MR781414
Zentralblatt MATH:
0563.60010
Digital Object Identifier: doi:10.1214/aop/1176993000
Project Euclid: euclid.aop/1176993000
Pittel, B. (1986). Paths in a random digital tree: Limiting distributions. Adv. in Appl. Probab. 18 139–155.
Mathematical Reviews (MathSciNet):
MR827333
Zentralblatt MATH:
0588.60012
Digital Object Identifier: doi:10.2307/1427240
JSTOR: links.jstor.org
Régnier, M. (1989). A limiting distribution for quicksort. RAIRO Inform. Théor. Appl. 23 335–343.
Mathematical Reviews (MathSciNet):
MR1020478
Rösler, U. (1991). A limit theorem for “Quicksort”. RAIRO Inform. Théor. Appl. 25 85–100.
Mathematical Reviews (MathSciNet):
MR1104413
Rösler, U. and Rüschendorf, L. (2001). The contraction method for recursive algorithms. Algorithmica 29 3–33. Average-case analysis of algorithms (Princeton, NJ, 1998).
Sawyer, S. A. (1997). Martin boundaries and random walks. Contemp. Math. 206 17–44.
Mathematical Reviews (MathSciNet):
MR1463727
Zentralblatt MATH:
0891.60073
Sedgewick, R. and Flajolet, P. (1996). An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, MA.
Zentralblatt MATH:
0841.68059
The Annals of Applied Probability
