Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.14206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914565063704576 |
|---|---|
| author | Attrill, Luke J. Garoni, Timothy M. |
| author_facet | Attrill, Luke J. Garoni, Timothy M. |
| contents | We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We consider the amount of time it takes this clumsy coupon collector to obtain the full set of $m$ coupons. We establish limit theorems as $m\to\infty$ for the clumsy coupon collection time, and describe the large $m$ asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, $p$, scales with $m$. If $p=o(1/m)$, we obtain a Gumbel limit theorem, as is the case for the classical coupon collector. If $p=ω(1/m)$, we instead show weak convergence to an exponential random variable. In the critical case, $p=c/m$, we give a full characterisation of the limiting distribution in terms of a birth-death process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14206 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The clumsy coupon collector's problem Attrill, Luke J. Garoni, Timothy M. Probability We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We consider the amount of time it takes this clumsy coupon collector to obtain the full set of $m$ coupons. We establish limit theorems as $m\to\infty$ for the clumsy coupon collection time, and describe the large $m$ asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, $p$, scales with $m$. If $p=o(1/m)$, we obtain a Gumbel limit theorem, as is the case for the classical coupon collector. If $p=ω(1/m)$, we instead show weak convergence to an exponential random variable. In the critical case, $p=c/m$, we give a full characterisation of the limiting distribution in terms of a birth-death process. |
| title | The clumsy coupon collector's problem |
| topic | Probability |
| url | https://arxiv.org/abs/2605.14206 |