Applications of Steins method in the analysis of random binary search trees. Steins method and Applications

Applications of Steins method in the analysis of random binary search trees. Steins method and Applications (2005)

Cached

Download Links

[cg.scs.carleton.ca]

by Luc Devroye

Venue:	Institute for Mathematical Sciences Lecture Notes Series
Citations:	1 - 0 self

BibTeX

@INPROCEEDINGS{Devroye05applicationsof,
    author = {Luc Devroye},
    title = {Applications of Steins method in the analysis of random binary search trees. Steins method and Applications},
    booktitle = {Institute for Mathematical Sciences Lecture Notes Series},
    year = {2005},
    pages = {247--297},
    publisher = {World Scientific Press}
}

Bookmark

OpenURL

Abstract

Abstract. Under certain conditions, sums of functions of subtrees of a random binary search tree are asymptotically normal. We show how Stein’s method can be applied to study these random trees, and survey methods for obtaining limit laws for such functions of subtrees.

Citations

1813	The Art of Computer Programming - Knuth - 1968
600	Random graphs - Janson, Luczak, et al. - 2000
380	Martingale Limit Theory and Its Applications - Hall, Heyde - 1980
194	Evolution of Random Search Trees - Mahmoud - 1992
156	Handbook of Algorithms and Data Structures - GONNET, R - 1991
126	Randomized search trees - Aragon, Seidel - 1989
93	Average-case analysis of algorithms and data structures. Research report INRIA 718 - Flajolet, Vitter - 1987
67	A note on the height of binary search trees - Devroye - 1986
62	A bound for the error in the normal approximation to the distribution of a sum of dependent random variables - Stein - 1971
59	Digital search trees revisited - Flajolet, Sedgewick - 1986
57	The contraction method for recursive algorithms - Rösler, Rüschendorf - 2001
48	Branching processes in the analysis of the heights of trees - Devroye - 1987
46	A limiting distribution for quicksort - Régnier - 1989
40	Asymptotic fringe distributions for general families of random trees - Aldous - 1991
39	M.: Martingale Central Limit Theorems - Brown - 1971
39	Dependent central limit theorems and invariance principles - McLeish - 1974
37	Phase change of limit laws in the quicksort recurrence under varying toll functions - HWANG, NEININGER
35	On growing random binary trees - Pittel - 1984
33	Smoothness and decay properties of the limiting Quicksort density function - Fill, Janson - 2000
33	A fixed point theorem for distributions. Stochastic Process - Rösler - 1992
30	Applications of the theory of records in the study of random trees - Devroye - 1988
30	On the distribution for binary search trees under the random permutation model. Random Structures and Algorithms 8 - Fill - 1996
30	Exact and asymptotic distributions in digital and binary search trees - Louchard - 1987
29	Quicksort asymptotics - Fill, Janson - 2002
28	The central limit theorem for dependent random variables - Hoeffding, Robbins - 1948
26	The expected linearity of a simple equivalence algorithm, Theoret - Knuth, Schdnhage - 1978
21	Some properties of a limiting distribution in - Tan, Hadjicostas - 1995
18	On normal approximations of distributions in terms of dependency graphs - Baldi, Rinott - 1989
16	Pal Asymptotic normality in the generalized Pólya-Eggenberger urn model, with an application to computer data structures - Bagchi, K - 1985
16	Approximating the limiting Quicksort distribution - Fill, Janson
15	On the most probable shape of a search tree grown from a random permutation - Mahmoud, Pittel - 1984
14	Limit laws for local counters in random binary search tree. Random Structures and Algorithms - Devroye - 1991
14	Patterns in random binary search trees, Random Structures Algorithms 11 - Flajolet, Gourdon, et al. - 1997
12	More combinatorial problems on certain trees - Lynch - 1965
12	Mathematical analysis of combinatorial algorithms - Sedgewick - 1983
12	An application of fourier methods to the problem of sharpening the berry-esseen inequality - Beek - 1972
11	Normal approximation under local dependence - Chen, Shao - 2004
11	A note on the central limit theorem for dependent random variables - Ibragimov - 1975
11	The analysis of a fringe heuristic for binary search trees - Poblete, Munro - 1985
9	Limit laws for sums of functions of subtrees of random binary search trees - Devroye
9	Distances and finger search in random binary search trees - Devroye, L, et al. - 2004
8	Stochastic analysis of tree-like data structures - Drmota
8	Description and analysis of an efficient priority queue representation - Francon, Viennot, et al. - 1978
8	On normal approximation rates for certain sums of dependent random variables - Rinott - 1994
7	Esseen, Fourier analysis of distribution functions - G - 1945
7	2002), A general contraction theorem and asymptotic normality in combinatorial structures, Annals of Applied Probability, accepted for publication (2003); available at www.stochastik.uni-freiburg.de/homepages/neininger - Neininger, Rüschendorf
6	Some examples of normal approximations by Stein’s method - Dembo, Rinott - 1996
6	Binary search tree recursions with harmonic toll functions - Panholzer, Prodinger - 2002
5	Central limit theorems under weak dependence - Bradley - 1981
4	Two central limit problems for dependent random variables,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete - Chen - 1978