Asymptotics of the rising moments for the coupon collector's problem

DOI10.1214/EJP.V18-1746MaRDI QIDQ388903zbMATH OpenOpenAlexFDO

Authors Aristides V. Doumas, Vassilis G. Papanicolaou

Publication date 17 January 2014

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.09045

zbMATH Keywords

coupon collector's problemhigher asymptotics

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Limit theorems in probability theory (60F99)

Abstract: A collector wishes to collect $m$ complete sets of $N$ distinct coupons. The draws from the population are considered to be independent and identical distributed with replacement, and the probability that a type-$j$ coupon is drawn is noted as $p_j$. Let $T_m(N)$ the number of trials needed for this problem. We present the asymptotics for the expectation (five terms plus an error), the second rising moment (six terms plus an error), and the variance of $T_m(N)$ (leading term), as well as its limit distribution as $Nightarrowinfty$, when �egin{equation*} p_{j}=frac{a_{j}}{sum_{j=2}^{N+1} a_{j}}, ,,, ext{where},,, a_{j}=left(ln j ight)^{-p}, ,,p>0. end{equation*} These "log-Zipf" classes of coupon probabilities are not covered by the existing literature and the present paper comes to fill this gap. Therefore, we enlarge the classes for which the collector's problem is solved (moments, variance, distribution).

Recommendations

• The coupon collector's problem revisited: asymptotics of the variance
• scientific article; zbMATH DE number 6297849
• scientific article; zbMATH DE number 3953937
• General asymptotic estimates for the coupon collector problem
• Asymptotics for the random coupon collector problem

Cited in

(18)

• Sampling from a mixture of different groups of coupons
• The coupon collector's problem revisited: asymptotics of the variance
• The siblings of the coupon collector
• Uniform versus Zipf distribution in a mixing collection process
• Asymptotic approximations for coupon collectors
• On the minimum of independent collecting processes via the Stirling numbers of the second kind
• Waiting time for a small subcollection in the coupon collector problem with universal coupon
• The logarithmic Zipf law in a general urn problem
• Two Poisson limit theorems for the coupon collector's problem with group drawings
• New results on a generalized coupon collector problem using Markov chains
• Convergence of point processes associated with coupon collector's and Dixie cup problems
• The maximum of independent geometric random variables as the time for genomic evolution
• Maximum of exponential random variables, Hurwitz's zeta function, and the partition function
• How many trials does it take to collect all different types of a population with probability \(p\)?
• Optimization results for a generalized coupon collector problem
• The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
• New easy to compute formulas for the moments of random variables appearing in the coupon collector problem
• On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors

This page was built for publication: Asymptotics of the rising moments for the coupon collector's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388903)