Highly Influenced
7 Excerpts
Poisson approximations for functionals of random trees
- Published 1996 in Random Struct. Algorithms
Abstract
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… (More)