Sampling from a mixture of different groups of coupons
Aristides V. Doumas, Vassilis G. Papanicolaou

TL;DR
This paper analyzes the probability and asymptotic behavior of the first detected group and total collection time when sampling coupons from multiple uniform groups, providing explicit formulas and limit distributions.
Contribution
It derives explicit formulas for detection probabilities and asymptotics for the total collection time in a multi-group coupon sampling model.
Findings
Explicit probability formulas for first group detection
Asymptotic analysis of total collection time for large coupon sets
Limiting distribution of total collection time
Abstract
A collector samples coupons with replacement from a pool containing \textit{uniform} groups of coupons, where "uniform group" means that all coupons in the group are equally likely to occur. For each let be the number of trials needed to detect Group , namely to collect all coupons belonging to it at least once. We derive an explicit formula for the probability that the -th group is the first one to be detected (symbolically, ). We also compute the asymptotics of this probability in the case as the number of coupons grows to infinity in a certain manner. Then, in the case of two groups we focus on , i.e. the number of trials needed to collect all coupons of the pool (at least once). We determine the asymptotics of and , as well as the limiting distribution of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
