Hanène Mohamed, Philippe Robert
Published 2004-12-09, updated 2006-02-24Version 2
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.
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)
Journal: Annals of Applied Probability 2005, Vol. 15, No. 4, 2445-2471
Probabilistic analysis of the (1+1)-evolutionary algorithm
Probabilistic Analysis for Randomized Game Tree Evaluation
Quicksort with unreliable comparisons: a probabilistic analysis
![QR code for arXiv:math/0412188 [math.PR]](http://oss.arxitics.com/images/favicon.svg)