Abstract
In this paper we study the number of random records in an arbitrary split tree (or, equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for the convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. After normalization the distributions are shown to be asymptotically weakly 1-stable. This work is a generalization of our earlier results for the random binary search tree in Holmgren (2010), which is one specific case of split trees. Other important examples of split trees includem-ary search trees, quad trees, medians of (2k+ 1)-trees, simplex trees, tries, and digital search trees.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference31 articles.
1. [16] Holmgren C. (2010). A weakly 1-stable limiting distribution for the number of random records and cuttings in split trees. Preprint. Available at http://arxiv.org/abs/1005.4590v1.
2. Random cutting and records in deterministic and random trees
3. Stopped Random Walks
4. Fixed points with finite variance of a smoothing transformation
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献