A probabilistic analysis of some tree algorithms
成果类型：
Article
署名作者：
Mohamed, H; Robert, P
署名单位：
Inria
刊物名称：
ANNALS OF APPLIED PROBABILITY
ISSN/ISSBN：
1050-5164
DOI：
10.1214/105051605000000494
发表日期：
2005
页码：
2445-2471
关键词：
摘要：
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.