Poisson approximations for functionals of random trees

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)
DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2%3C79::AID-RSA5%3E3.0.CO;2-8

Topics

3 Figures and Tables

Slides referencing similar topics