Random Records and Cuttings in Complete Binary Trees

@inproceedings{Janson2004RandomRA,
  title={Random Records and Cuttings in Complete Binary Trees},
  author={Svante Janson},
  year={2004}
}
We study the number of records in a complete binary tree with randomly labeled vertices or edges. Equivalently, we may study the number of random cuttings required to eliminate a complete binary tree. The distribution is, after normalization, asymptotically a periodic function of lg n − lg lg n; thus there is no true asymptotic distribution but a family of limits of different subsequences; these limits are similar to a 1-stable distribution but have some periodic fluctuations. 
BETA

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

The Art of Computer Programming

  • D. E. Knuth
  • Vol. 1: Fundamental Algorithms. 3nd ed., Addison…
  • 1997

An Introduction to Probability Theory and Its Applications

  • W. Feller
  • Vol. II. Second edition,
  • 1971

1962)

  • A. Rényi
  • On the extreme elements of observations. MTA III…
  • 1962
1 Excerpt

Similar Papers

Loading similar papers…