Uniform versus Zipf distribution in a mixing collection process
From MaRDI portal
Publication:2273725
DOI10.1016/j.spl.2019.108559zbMath1423.60042arXiv1904.09817OpenAlexW2966661565MaRDI QIDQ2273725
Vassilis G. Papanicolaou, Aristides V. Doumas
Publication date: 25 September 2019
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.09817
Related Items (2)
The logarithmic Zipf law in a general urn problem ⋮ Sampling from a mixture of different groups of coupons
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotics of the rising moments for the coupon collector's problem
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- The Coupon Collector's Problem Revisited: Asymptotics of the Variance
- The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
- The Generalised Coupon Collector Problem
- Least effort and the origins of scaling in human language
This page was built for publication: Uniform versus Zipf distribution in a mixing collection process