Coupon collector's problem

Coupon collector's problem
Parameters	$n\in \mathbb {N}$ – number of faces on die
Support	$k\in \mathbb {N}$ – rolls taken for all faces to appear
PMF	${\frac {(n-1)^{\{x-1\}}}{n^{x-1}}}$
CDF	${\frac {n^{\{x\}}}{n^{x}}}$
Mean	$nH_{n}$
Variance	$n^{2}H_{n}^{(2)}-nH_{n}$
Skewness	${\frac {2n^{3}H_{n}^{(3)}-3n^{2}H_{n}^{(2)}+nH_{n}}{\left(n^{2}H_{n}^{(2)}-nH_{n}\right)^{3/2}}}\ {\underset {n}{\sim }}\ 6^{3/2}2{\frac {\zeta (3)}{\pi ^{3}}}$
Excess kurtosis	${\frac {6n^{4}H_{n}^{(4)}-12n^{3}H_{n}^{(3)}+7n^{2}H_{n}^{(2)}-nH_{n}}{(n^{2}H_{n}^{(2)}-nH_{n})^{2}}}\sim {\frac {6}{5}}$
MGF	${{\frac {n}{e^{t}}} \choose n}^{-1}$
CF	${{\frac {n}{e^{it}}} \choose n}^{-1}$
PGF	$G(z)={{\frac {n}{z}} \choose n}^{-1}$

Graph of number of coupons, n vs the expected number of trials (i.e., time) needed to collect them all E(T)

In probability theory, the coupon collector's problem refers to mathematical analysis of "collect all coupons and win" contests. It asks the following question: if each box of a given product (e.g., breakfast cereals) contains a coupon, and there are n different types of coupons, what is the probability that more than t boxes need to be bought to collect all n coupons? An alternative statement is: given n coupons, how many coupons do you expect you need to draw with replacement before having drawn each coupon at least once? The mathematical analysis of the problem reveals that the expected number of trials needed grows as $\Theta (n\log(n))$. For example, when n = 50 it takes about 225 trials on average to collect all 50 coupons. Sometimes the problem is instead expressed in terms of an n-sided die.

Solution

Calculating the expectation

Let time T be the number of draws needed to collect all n coupons, and let t_i be the time to collect the i-th coupon after i − 1 coupons have been collected. Then $T=t_{1}+\cdots +t_{n}$. Think of T and t_i as random variables. Observe that the probability of collecting a new coupon is $p_{i}={\frac {n-(i-1)}{n}}={\frac {n-i+1}{n}}$. Therefore, $t_{i}$ has geometric distribution with expectation ${\frac {1}{p_{i}}}={\frac {n}{n-i+1}}$. By the linearity of expectations we have:

${\begin{aligned}\operatorname {E} (T)&{}=\operatorname {E} (t_{1}+t_{2}+\cdots +t_{n})\\&{}=\operatorname {E} (t_{1})+\operatorname {E} (t_{2})+\cdots +\operatorname {E} (t_{n})\\&{}={\frac {1}{p_{1}}}+{\frac {1}{p_{2}}}+\cdots +{\frac {1}{p_{n}}}\\&{}={\frac {n}{n}}+{\frac {n}{n-1}}+\cdots +{\frac {n}{1}}\\&{}=n\cdot \left({\frac {1}{1}}+{\frac {1}{2}}+\cdots +{\frac {1}{n}}\right)\\&{}=n\cdot H_{n}.\end{aligned}}$

Here H_n is the n-th harmonic number. Using the asymptotics of the harmonic numbers, we obtain:

$\operatorname {E} (T)=n\cdot H_{n}=n\log n+\gamma n+{\frac {1}{2}}+O(1/n),$

where $\gamma \approx 0.5772156649$ is the Euler–Mascheroni constant.

Using the Markov inequality to bound the desired probability:

$\operatorname {P} (T\geq cnH_{n})\leq {\frac {1}{c}}.$

The above can be modified slightly to handle the case when we've already collected some of the coupons. Let k be the number of coupons already collected, then:

${\begin{aligned}\operatorname {E} (T_{k})&{}=\operatorname {E} (t_{k+1}+t_{k+2}+\cdots +t_{n})\\&{}=n\cdot \left({\frac {1}{1}}+{\frac {1}{2}}+\cdots +{\frac {1}{n-k}}\right)\\&{}=n\cdot H_{n-k}\end{aligned}}$

And when $k=0$ then we get the original result.

Calculating the variance

Using the independence of random variables t_i, we obtain:

${\begin{aligned}\operatorname {Var} (T)&{}=\operatorname {Var} (t_{1}+\cdots +t_{n})\\&{}=\operatorname {Var} (t_{1})+\operatorname {Var} (t_{2})+\cdots +\operatorname {Var} (t_{n})\\&{}={\frac {1-p_{1}}{p_{1}^{2}}}+{\frac {1-p_{2}}{p_{2}^{2}}}+\cdots +{\frac {1-p_{n}}{p_{n}^{2}}}\\&{}=\left({\frac {n^{2}}{n^{2}}}+{\frac {n^{2}}{(n-1)^{2}}}+\cdots +{\frac {n^{2}}{1^{2}}}\right)-\left({\frac {n}{n}}+{\frac {n}{n-1}}+\cdots +{\frac {n}{1}}\right)\\&{}=n^{2}\cdot \left({\frac {1}{1^{2}}}+{\frac {1}{2^{2}}}+\cdots +{\frac {1}{n^{2}}}\right)-n\cdot \left({\frac {1}{1}}+{\frac {1}{2}}+\cdots +{\frac {1}{n}}\right)\\&{}<{\frac {\pi ^{2}}{6}}n^{2}\end{aligned}}$

since ${\frac {\pi ^{2}}{6}}={\frac {1}{1^{2}}}+{\frac {1}{2^{2}}}+\cdots +{\frac {1}{n^{2}}}+\cdots$ (see Basel problem).

Bound the desired probability using the Chebyshev inequality:

$\operatorname {P} \left(|T-nH_{n}|\geq cn\right)\leq {\frac {\pi ^{2}}{6c^{2}}}.$

Stirling numbers

Let the random variable X be the number of dice rolls performed before all faces have occurred.

The subpower is defined $k^{\{n\}}=k!\left\{{n \atop k}\right\}$, where $\left\{{n \atop k}\right\}$ is a Stirling number of the second kind.

Sequences of $x$ die rolls are functions $x\rightarrow n$ counted by $n^{x}$, while surjections (that land on each face at least once) are counted by $n^{\{x\}}$, so the probability that all faces were landed on within the x-th throw is $P(X\leq x)={\frac {n^{\{x\}}}{n^{x}}}$. By the recurrence relation of the Stirling numbers, the probability that exactly x rolls are needed is $P(X=x)={\frac {n^{\{x\}}}{n^{x}}}-{\frac {n^{\{x-1\}}}{n^{x-1}}}={\frac {(n-1)^{\{x-1\}}}{n^{x-1}}}$

Generating functions

Replacing $z$ with $1+z$ in the probability generating function produces the o.g.f. for $E\left[{X \choose k}\right]$. Using the partial fraction decomposition ${{\frac {1}{x}}-1 \choose n}^{-1}=\sum _{k=0}^{n}{n \choose k}{\frac {(-1)^{n-k}}{1-kx}}$, we can take the expansion

${\begin{aligned}&{{\frac {n}{x+1}} \choose n}^{-1}\\=&\sum _{i=0}^{n}{n \choose i}{\frac {(-1)^{n-i}}{1-i(1-{\frac {n}{x+1+n}})}}\\=&\sum _{i=0}^{n}{n \choose i}(-1)^{n-i}\left({\frac {1+n}{1+n-i}}+in\sum _{k=1}^{\infty }{\frac {(i-1)^{k-1}}{(n+1-i)^{k+1}}}x^{k}\right)\end{aligned}}$

revealing that for $k>0$,

$E\left[{X \choose k}\right]=n\sum _{i=0}^{n}{n \choose i}(-1)^{n-i}i{\frac {(i-1)^{k-1}}{(n+1-i)^{k+1}}}$

Given an o.g.f. f, since $\left({\frac {x}{1-x}}\right)^{i}=\sum _{n=0}^{\infty }{k-1 \choose i-1}x^{k}$, a variation of the binomial transform is $[x^{k}]f\left({\frac {x}{1+x}}\right)=\sum _{i=0}^{k}{k-1 \choose i-1}(-1)^{k-i}[x^{i}]f(x)$. (Specifically, if ${{\frac {n}{x+1}} \choose n}^{-1}=f\left({\frac {x}{1+x}}\right)$, $f(x)={n-nx \choose n}^{-1}$.)

Rewriting the binomial coefficient via the gamma function and expanding as the $\exp$ of the polygamma series (in terms of generalised harmonic numbers), we find $\left[{\frac {x^{i}}{i!}}\right]{n-x \choose n}^{-1}=\sum _{P\in \mathrm {perms} (i)}\prod _{c\in P}H_{n}^{(|c|)}$, so

$E\left[{X \choose k}\right]=\sum _{i=0}^{k}{k-1 \choose i-1}(-1)^{k-i}{\frac {n^{i}}{i!}}\sum _{P\in \mathrm {perms} (i)}\prod _{c\in P}H_{n}^{(|c|)}$

which can also be written with the falling factorial and Lah numbers as

$E[x^{\underline {k}}]=\sum _{i=0}^{k}L(k,i)(-1)^{k-i}n^{i}\sum _{P\in \mathrm {perms} (i)}\prod _{c\in P}H_{n}^{(|c|)}$

The raw moments of the distribution can be obtained from the falling moments via a Stirling transform; due to the identity $\left\{{K \atop i}\right\}(-1)^{K}=\sum _{k=0}^{K}\left\{{K \atop k}\right\}L(k,i)(-1)^{k}$, this provides

$E[x^{k}]=\sum _{i=0}^{k}\left\{{k \atop i}\right\}(-1)^{k-i}n^{i}\!\!\sum _{P\in \mathrm {perms} (i)}\prod _{c\in P}H_{n}^{(|c|)}$

Tail estimates

A stronger tail estimate for the upper tail be obtained as follows. Let ${Z}_{i}^{r}$ denote the event that the $i$-th coupon was not picked in the first $r$ trials. Then

${\begin{aligned}P\left[{Z}_{i}^{r}\right]=\left(1-{\frac {1}{n}}\right)^{r}\leq e^{-r/n}.\end{aligned}}$

Thus, for $r=\beta n\log n$, we have $P\left[{Z}_{i}^{r}\right]\leq e^{(-\beta n\log n)/n}=n^{-\beta }$. Via a union bound over the $n$ coupons, we obtain

${\begin{aligned}P\left[T>\beta n\log n\right]=P\left[\bigcup _{i}{Z}_{i}^{\beta n\log n}\right]\leq n\cdot P[{Z}_{1}^{\beta n\log n}]\leq n^{-\beta +1}.\end{aligned}}$

Extensions and generalizations

• Pierre-Simon Laplace, but also Paul Erdős and Alfréd Rényi, proved the limit theorem for the distribution of T. This result is a further extension of previous bounds. A proof is found in.

$\operatorname {P} (T<n\log n+cn)\to e^{-e^{-c}},{\text{ as }}n\to \infty .$ which is a Gumbel distribution. A simple proof by martingales is in the next section.

• Donald J. Newman and Lawrence Shepp gave a generalization of the coupon collector's problem when m copies of each coupon need to be collected. Let T_m be the first time m copies of each coupon are collected. They showed that the expectation in this case satisfies:

$\operatorname {E} (T_{m})=n\log n+(m-1)n\log \log n+O(n),{\text{ as }}n\to \infty .$

Here m is fixed. When m = 1 we get the earlier formula for the expectation.

• Common generalization, also due to Erdős and Rényi:

$\operatorname {P} \left(T_{m}<n\log n+(m-1)n\log \log n+cn\right)\to e^{-e^{-c}/(m-1)!},{\text{ as }}n\to \infty .$

• In the general case of a nonuniform probability distribution, according to Philippe Flajolet et al.

$\operatorname {E} (T)=\int _{0}^{\infty }\left(1-\prod _{i=1}^{m}\left(1-e^{-p_{i}t}\right)\right)dt.$

This is equal to

$\operatorname {E} (T)=\sum _{q=0}^{m-1}(-1)^{m-1-q}\sum _{|J|=q}{\frac {1}{1-P_{J}}},$

where m denotes the number of coupons to be collected and P_J denotes the probability of getting any coupon in the set of coupons J.

See also

• McDonald's Monopoly – an example of the coupon collector's problem that further increases the challenge by making some coupons of the set rarer
• Watterson estimator
• Birthday problem

References

Bibliography

• Blom, Gunnar; Holst, Lars; Sandell, Dennis (1994), "7.5 Coupon collecting I, 7.6 Coupon collecting II, and 15.4 Coupon collecting III", Problems and Snapshots from the World of Probability, New York: Springer-Verlag, pp. 85–87, 191, ISBN 0-387-94161-4, MR 1265713.
• Dawkins, Brian (1991), "Siobhan's problem: the coupon collector revisited", The American Statistician, 45 (1): 76–82, doi:10.2307/2685247, JSTOR 2685247.
• Erdős, Paul; Rényi, Alfréd (1961), "On a classical problem of probability theory" (PDF), Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei, 6: 215–220, MR 0150807.
• Laplace, Pierre-Simon (1812), Théorie analytique des probabilités, pp. 194–195.
• Newman, Donald J.; Shepp, Lawrence (1960), "The double dixie cup problem", American Mathematical Monthly, 67 (1): 58–61, doi:10.2307/2308930, JSTOR 2308930, MR 0120672
• Flajolet, Philippe; Gardy, Danièle; Thimonier, Loÿs (1992), "Birthday paradox, coupon collectors, caching algorithms and self-organizing search", Discrete Applied Mathematics, 39 (3): 207–229, doi:10.1016/0166-218X(92)90177-C, MR 1189469.
• Isaac, Richard (1995), "8.4 The coupon collector's problem solved", The Pleasures of Probability, Undergraduate Texts in Mathematics, New York: Springer-Verlag, pp. 80–82, ISBN 0-387-94415-X, MR 1329545.
• Motwani, Rajeev; Raghavan, Prabhakar (1995), "3.6. The Coupon Collector's Problem", Randomized algorithms, Cambridge: Cambridge University Press, pp. 57–63, ISBN 9780521474658, MR 1344451.

External links

• "Coupon Collector Problem" by Ed Pegg, Jr., the Wolfram Demonstrations Project. Mathematica package.
• How Many Singles, Doubles, Triples, Etc., Should The Coupon Collector Expect?, a short note by Doron Zeilberger.