Proves Poisson limit for untouched labels under growing-block colored shuffles and derives explicit separation, TV, and ILR cutoff profiles on C_p wr S_n.
Asymptotic Results for Uniform Group Drawing in the Coupon Collector's Problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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 $s$ distinct coupons selected uniformly at random from a set of $n$ coupons. We focus on three regimes of the package size $s$: (i) constant $s$, (ii) $s$ proportional to $n$, and (iii) $s$ "very close" to $n$. 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
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Cutoff profiles for colored top-m-to-random shuffles with growing block size
Proves Poisson limit for untouched labels under growing-block colored shuffles and derives explicit separation, TV, and ILR cutoff profiles on C_p wr S_n.