Applications of Stein’s method in the analysis of random binary search trees

Stein’s Method and Applications

Volumn , Issue , 2005, Pages 247-297

  Devroye, Luc ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77951258582     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789812567673_0016     Document Type: Chapter

References (62)

1. D. ALDOUS (1991) Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab. 1, 228-266.
2. C. R. ARAGON and R. G. SEIDEL (1996) Randomized search trees. Algorith-mica, 16, 464-497.
3. C. R. ARAGON and R. G. SEIDEL (1989) Randomized search trees. In: Proc. 30th IEEE Symp. Foundations Comp. Set., 540-545.
4. A. BAGCHI and A. K. PAL (1985) Asymptotic normality in the generalized Polya-Eggenberger unrn model, with an application to computer data structures. SIAM J. Algebraic Discr. Methods 6, 394-405.
5. P. BALDI and Y. RINOTT (1989) On normal approximation of distributions in terms of dependency graph. Ann. Probab. 17, 1646-1650.
6. R. C. BRADLEY (1981) Central limit theorems under weak dependence. J. Math. Anal. 11, 1-16.
7. B. M. BROWN (1971) Martingale central limit theorems. Ann. Math. Statist. 42, 59-66.
8. L. H. Y. CHEN (1978) Two central limit problems for dependent random variables. Z. Wahrsch. verw. Geb. 43, 223-243.
9. L. H. Y. CHEN and Q.-M. SHAO (2004) Normal approximation under local dependence. Ann. Probab. 32, 1985-2028.
10. A. DEMBO and Y. RINOTT (1996) Some examples of normal approximations by Stein’s method. In: Random Discrete Structures, eds. D. Aldous and R. Pe-mantle, pp. 25-44. Springer-Verlag, New York.
11. L. DEVROYE (1986) A note on the height of binary search trees. Journal of the ACM 33, 489-498.
12. L. DEVROYE (1987) Branching processes in the analysis of the heights of trees. Acta Informatica 24, 277-298.
13. L. DEVROYE (1988) Applications of the theory of records in the study of random trees. Acta Informatica 26, 123-130.
14. L. DEVROYE (1991) Limit laws for local counters in random binary search trees. Rand. Struct. Alg. 2, 303-316.
15. L. DEVROYE (1994) On random Cartesian trees. Rand. Struct. Alg. 5, 305-327.
16. L. DEVROYE (2002) Limit laws for sums of functions of subtrees of random binary search trees. SIAM J. Computing 32, 152-171. 2002.
17. L. DEVROYE and R. NEININGER (2004) Distances and finger search in random binary search trees. SIAM J. Computing 33, 647-658.
18. M. DRMOTA (2004) Stochastic analysis of tree-like data structures. Proc. Roy. Soc: Math., Phys. Engin. Sci. 460, 271-307.
19. A. DVORETZKY (1972) Central limit theorems for dependent random variables. In: Proc. Sixth Berkeley Symp. Math. Statist. Prob. pp. 513-535. University of California Press.
20. C. G. ESSEEN (1945) Fourier analysis of distribution functions: a mathematical study of the Laplace-Gaussian law. Acta Mathematica 77, 1-125.
21. W. FELLER (1968) On the Berry-Esseen theorem. Z. Wahrsch. verw. Geb. 10, 261-268.
22. J. A. FILL (1996) On the distribution of binary search trees under the random permutation model. Rand. Struct. Alg. 8, 1-25.
23. J. A. FILL and S. JANSON (2000) Smoothness and decay properties of the limiting QUICKSORT density function. In: Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, eds. D. Gardy and A. Mokkadem, pp. 53-64. Birkhauser, Boston.
24. J. A. FILL and S. JANSON (2001) Approximating the limiting QUICKSORT distribution. Rand. Struct. Alg. 19, 376-406.
25. J. A. FILL and S. JANSON (2002) Quicksort asymptotics. J. Algorithms 44, 4-28.
26. P. FLAJOLET and R. SEDGEWICK (1986) Digital search trees revisited. SIAM J. Computing 15, 748-767.
27. P. FLAJOLET, X. GOURDON, and C. MARTINEZ (1997) Patterns in random binary search trees. Rand. Struct. Alg. 11, 223-244.
28. J. FRANÇON, G. VIENNOT, and J. VUILLEMIN (1978) Description and analysis of an efficient priority queue representation. In: Proceedings of the 19th IEEE Symposium on the Foundations of Computer Science, pp. 1-7.
29. G. H. GoNNET (1984) Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, Mass.
30. P. GRABNER and H. PRODINGER (2002) Sorting algorithms for broadcast communications: mathematical analysis. Theor. Comp. Science 289, 51-67.
31. G. R. GRIMMETT and D. R. STIRZAKER (1992) Probability and Random Processes. Oxford University Press.
32. P. HALL and C. C. HEYDE (1980) Martingale Limit Theory and its Applications. Academic Press, New York.
33. W. HOEFFDING and H. ROBBINS (1949) The central limit theorem for dependent random variables. Ann. Math. Statist. 20, 773-780.
34. H.-K. HWANG and R. NEININGER (2002) Phase change of limit laws in quicksort recurrence under varying toll functions. SIAM J. Computing 31, 1687-1722.
35. I. A. IBRAGIMOV (1975) A note on the central limit theorem for dependent random variables. Theor. Probab. Appl. 20, 135-141.
36. S. JANSON, T. LUCZAK, and A. RUCINSKI (2000) Random Graphs. John Wiley, New York.
37. D. E. KNUTH (1973) The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass.
38. D. E. KNUTH and A. SCHONHAGE (1978) The expected linearity of a simple equivalence algorithm. Theor. Comp. Sci. 6, 281-315.
39. G. LOUCHARD (1987) Exact and asymptotic distributions in digital binary search trees. RAIRO Theor. Informatics Applies 13, 253-276.
40. W. C. LYNCH (1965) More combinatorial problems on certain trees. Computer Journal, 7, 299-302.
41. H. MAHMOUD and B. PITTEL (1984) On the most probable shape of a search tree grown from. SIAM J. Algebraic Discr. Methods 5, 69-81.
42. H. M. MAHMOUD (1986) The expected distribution of degrees in random binary search trees. The Computer Journal 29, 36-37.
43. H. M. MAHMOUD (1992) Evolution of Random Search Trees. John Wiley, New York.
44. D. L. MCLEISH (1974) Dependent central limit theorems and invariance principles. Ann. Probab. 2, 620-628.
45. R. NEININGER and L. RÜSCHENDORF (2004) A general contraction theorem and asymptotic normality in combinatorial structures. Adv. Appl. Prob. 14, 378-418.
46. A. PANHOLZER and H. PRODINGER (2002) Binary search tree recursions with harmonic toll functions. J. Comp. Appl. Math. 142, 211-225.
47. B. PITTEL (1984) On growing random binary trees. J. Math. Anal. Applies 103, 461-480.
48. P. V. POBLETE and J. I. MUNRO (1985) The analysis of a fringe heuristic for binary search trees. J. Algorithms 6, 336-350.
49. M. RÉGNIER (1989) A limiting distribution for quicksort. RAIRO Informatique Théor. Applic. 23, 335-343.
50. Y. RINOTT (1994) On normal approximation rates for certain sums of dependent random variables. J. Comp. Appl. Math 55, 135-143.
51. J. M. ROBSON (1979) The height of binary search trees. Austral. Comp. J. 11, 151-153.
52. U. RÖSLER (1991) A limit theorem for quicksort. Theor. Informatics Applies 25, 85-100.
53. U. RÖSLER (1992) A fixed point theorem for distributions. Stoch. Procs. Applies 42, 195-214.
54. U. RÖSLER and L. RUSCHENDORF (2001) The contraction method for recursive algorithms. Algorithmica, 29, 3-33.
55. R. SEDGEWICK (1983) Mathematical analysis of combinatorial algorithms. In: Probability Theory and Computer Science, eds. G. Louchard and G. La-touche, pp. 123-205. Academic Press, London.
56. A. A. SHERGIN (1979) On the convergence rate in the central limit theorem for m-dependent random variables. Theor. Probab. Appl. 24, 782-796.
57. I. S. SHIGANOV (1986) Refinement of the upper bound of the constant in the central limit theorem. J. Soviet Math. 50, 2545-2550.
58. C. STEIN (1972) A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. Proc. Sixth Berkeley Symp. Math. Statist. Prob. 2, pp. 583-602. Univ. California Press.
59. K. H. TAN and P. HADJICOSTAS (1995) Some properties of a limiting distribution in quicksort. Statist. Probab. Lett. 25, 87-94.
60. P. VAN BEEK (1972) An application of Fourier methods to the problem of sharpening the Berry-Esseen inequality. Z. Wahrsch. verw. Geb. 23, 183-196.
61. J. S. VITTER and P. FLAJOLET (1990) Average-case analysis of algorithms and data structures. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, ed. J. van Leeuwen, pp. 431-524. MIT Press, Amsterdam
62. J. VUILLEMIN (1978) A data structure for manipulating priority queues. Commun. ACM 21, 309-314.