no. 14 · Friday 13 November 2026
Cutoff profile for the coupon collector with many collections
Abstract
We consider the problem posed by Erdős and Rényi in $1961$ about the limiting distribution of the number of draws $T_{n,m}$ that a coupon collector needs to complete $m$ collections of $n$ distinct types of coupons, when $m$ increases with $n$. Although the limiting distribution was studied in earlier works, we give a simple and self-contained proof that relates it to the cutoff phenomenon for an absorbing Markov chain. We also provide an alternative expression for the cutoff window in terms of the Lambert $W$ function.
- fields
- Probability