The size of random bucket trees via urn models
β Scribed by Hosam M. Mahmoud
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- English
- Weight
- 51 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Devroye (SIAM J. Comput. 28 (1999) 1215 -1224) computed the average size of several random hash-based trees. We extend this analysis by ΓΏnding the central limit distribution for a suitably normalized version of the size of each of random hash trees, pebbled hash trees and N-trees. Because of a stron
We determine the asymptotic behavior of the expected value and the variance of the log-product of the subtree-sizes of trees T belonging to simply generated families of n
We consider four families of forests on n vertices: labeled and unlabeled forests containing rooted and unrooted trees, respectively. A forest is chosen uniformly from one of the given four families. The limiting distribution of the size of its largest tree is then studied as n Βͺ Ο±. Convergences to
The asymptotic behavior of the mean and the variance of the log-product of the subtree-sizes of trees belonging to simply generated families of rooted trees were determined in this paper. The authors have learned that Professor Boris Pittel, in a manuscript entitled ''Normal Convergence Problem? Two