A probabilistic analysis of some tree algorithms
Probability
2016-08-16 v2
Abstract
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain.
Cite
@article{arxiv.math/0412188,
title = {A probabilistic analysis of some tree algorithms},
author = {Hanène Mohamed and Philippe Robert},
journal= {arXiv preprint arXiv:math/0412188},
year = {2016}
}
Comments
Published at http://dx.doi.org/10.1214/105051605000000494 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)