Tree-based models for random distribution of mass
β Scribed by David Aldous
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 743 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar
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
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