Poisson approximations for functionals of random trees

@article{Dobrow1996PoissonAF,
  title={Poisson approximations for functionals of random trees},
  author={Robert P. Dobrow and Robert T. Smythe},
  journal={Random Struct. Algorithms},
  year={1996},
  volume={9},
  pages={79-92}
}
We use Poisson approximation techniques for sums of indicator random variables to derive explicit error bounds and central limit theorems for several functionals of random trees. In particular, we consider (i) the number of comparisons for successful and unsuccessful search in a binary search tree and (ii) internode distances in increasing trees. The Poisson approximation setting is shown to be a natural and fairly simple framework for deriving asymptotic results. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The distance between nodes in recursive trees

J. W. Moon
London Math. Soc. Lecture Notes Ser., No. 13, Cambridge University Press, London, 125–132 • 1974
View 6 Excerpts
Highly Influenced

Poisson Approximation

A. D. Barbour, L. Holst, S. Janson
Oxford University Press, Oxford, • 1992
View 4 Excerpts
Highly Influenced

Distances in plane-oriented recursive trees

H. M. Mahmoud
J. Comp. Appl. Math. 41, 237–245 • 1992
View 5 Excerpts
Highly Influenced

Evolution of random search trees

Wiley-Interscience series in discrete mathematics and optimization • 1992
View 5 Excerpts
Highly Influenced

A survey of recursive trees

R. T. Smythe, H. M. Mahmoud
Theo. Prob. Math. Stat., to appear. • 1995
View 1 Excerpt

Limiting distributions for path lengths in recursive trees

H. M. Mahmoud
Prob. Engr. Info. Sci. 5, 53–59 • 1991
View 2 Excerpts

Similar Papers

Loading similar papers…