Asymptotic Results for Uniform Group Drawing in the Coupon Collector's Problem
Abstract
The article explores the asymptotic behavior of the expected number of drawings in the Coupon Collector's Problem with group-drawing under the uniform distribution. In this variant, each draw consists of a package of distinct coupons selected uniformly at random from a set of coupons. We focus on three regimes of the package size : (i) constant , (ii) proportional to , and (iii) "very close" to . For each case, we provide precise asymptotic expressions for the expected collection time. Keywords: Coupon Collector's Problem, Group Drawings, Uniform Distribution, Asymptotic Analysis, Expected Collection Time
Keywords
Cite
@article{arxiv.2605.06953,
title = {Asymptotic Results for Uniform Group Drawing in the Coupon Collector's Problem},
author = {Daniel Berend and Tomer Sher},
journal= {arXiv preprint arXiv:2605.06953},
year = {2026}
}
Comments
This article and arXiv:2509.17201 together supersede the original preprint, following their acceptance as two separate papers in Stochastic Models. This part focuses on asymptotic results for uniform group drawing in the coupon collector's problem