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
The size of random fragmentation trees
✍ Scribed by Svante Janson; Ralph Neininger
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 472 KB
- Volume
- 142
- Category
- Article
- ISSN
- 1432-2064
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Upon isolation of DNA from normal eukaryotic cells by standard methods involving extensive proteolytic treatment, a rather homogeneous population of loop‐size, double‐stranded DNA fragments is regularly obtained. These DNA molecules can be efficiently end‐labeled by the DNA polymerase I
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
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