Poisson approximations for functionals of random trees

Random Structures and Algorithms

Volumn 9, Issue 1, 1996, Pages 79-92

  Dobrow, Robert P ^a   Smythe, Robert T ^b  

^a TRUMAN STATE UNIVERSITY   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Binary search trees; Increasing trees; Poisson approximation; Recursive trees

Indexed keywords

EID: 21444447622     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2<79::AID-RSA5>3.0.CO;2-8     Document Type: Article

References (19)

1. R. Arratia, L. Goldstein, and L. Gordon, Poisson approximation and the Chen-Stein method, Stat. Sci., 5, 403-434 (1990).
2. R. Arratia and S. Tavaré, Limit theorems for combinatorial structures via discrete process approximations, Random Struct. Alg., 3, 321-345 (1992).
3. A. D. Barbour and P. Hall, On the rate of Poisson convergence, Math. Proc. Camb. Phil. Soc., 95, 473-480 (1984).
4. A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Oxford University Press, Oxford, 1992.
5. G. Brown and B. Shubert, On random binary trees, Math. Oper. Res., 9, 43-65 (1984).
6. L. H. Y. Chen, Poisson approximation for dependent trials, Ann. Probab., 3, 534-545 (1975).
7. L. H. Y. Chen, An approximation theorem for sums of certain randomly selected indicators, Z. Wahrsch. Verw. Geb., 33, 223-243 (1975).
8. L. Devroye, Applications of the theory of records in the study of random trees, Acta Inf., 26, 123-130 (1988).
9. R. P. Dobrow, On the distribution of distances in recursive trees, J. Appl. Probab. (1996), to appear.
10. G. Louchard, Exact and asymptotic distributions in digital and binary search trees, Theor. Inf. Appl., 21, 471-495 (1987).
11. W. Lynch, More combinatorial properties of certain trees, Comput. J., 1, 299-302 (1965).
12. H. M. Mahmoud, Limiting distributions for path lengths in recursive trees, Probab. Eng. Inf. Sci., 5, 53-59 (1991).
13. H. M. Mahmoud, Distances in plane-oriented recursive trees, J. Comp. Appl. Math., 41, 237-245 (1992).
14. H. M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
15. J. W. Moon, The distance between nodes in recursive trees, in London Math. Soc. Lecture Notes Ser., No. 13, Cambridge University Press, London, 1974, 125-132.
16. B. Pittel, Note on the heights of random recursive trees and random m-ary search trees. Random Struct. Alg., 5, 337-347 (1994).
17. R. T. Smythe and H. M. Mahmoud, A survey of recursive trees, Theor. Probab. Math. Stat. (1995) to appear.
18. C. M. Stein, A bound for the error in the normal approximation to the distribution of a sum of dependent random variables, Proc. 6th Berkeley Symp. Math. Stat. Probab. 2, University of California Press, Berkeley, 1972, pp. 583-602.
19. J. Szymański, On a nonuniform random recursive tree, Ann. Discrete Math., 33, 297-306 (1987).