Abstract
We study the number of random records in a binary search tree with n vertices (or equivalently, the number of cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. The asymptotic distribution of the (normalized) number of records or cuts is found to be weakly 1-stable.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference19 articles.
1. Foundations of Modern Probability
2. Random Graphs
3. [10] Holmgren C. (2009) A weakly 1-stable limiting distribution for the number of random records and cuttings in split trees. Submitted.
4. Random records and cuttings in split trees: Extended abstract;Holmgren;Discrete Math. Theor. Comput. Sci.,2008
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献