Answers are grounded in this paper and cite their sources.
Study demonstrates quantitative limit theorems for coupon drawing fluctuations as n increases, suggesting implications for probability theory.
We study the coupon collector’s problem with group drawings. Assume there are n different coupons. At each time precisely s of the n coupons are drawn, where all choices are supposed to have equal probability. The focus lies on the fluctuations, as n→∞ , of the number Zn,s(kₙ) of coupons that have not been drawn in the first kₙ drawings. Using a size-biased coupling construction together with Stein’s method for normal approximation, a quantitative central limit theorem for Zn,s(kₙ) is shown for the case that kₙ=(n/s)(αlog(n)+x) , where 0<α<1 and x . The same coupling construction is used to retrieve a quantitative Poisson limit theorem in the boundary case α=1 , again using Stein’s method.
No takes yet. Share an insight, caveat, or question.
Betken et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: