Coupon collector's problem

src: i.ytimg.com

In probability theory, the coupon collector's problem describes the "collect all coupons and win" contests. It asks the following question: Suppose that there is an urn of n different coupons, from which coupons are being collected, equally likely, with replacement. What is the probability that more than t sample trials are needed 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 ${\displaystyle \Theta (n\log(n))}$. For example, when n = 50 it takes about 225 trials on average to collect all 50 coupons.

Video Coupon collector's problem

Solution

Calculating the expectation

Let T be the time 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. Think of T and t_i as random variables. Observe that the probability of collecting a new coupon is p_i = (n - (i - 1))/n. Therefore, t_i has geometric distribution with expectation 1/p_i. By the linearity of expectations we have:

${\displaystyle {\begin{aligned}\operatorname {E} (T)&=\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:

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

where ${\displaystyle \gamma \approx 0.5772156649}$ is the Euler-Mascheroni constant.

Now one can use the Markov inequality to bound the desired probability:

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

Calculating the variance

Using the independence of random variables t_i, we obtain:

${\displaystyle {\begin{aligned}\operatorname {Var} (T)&=\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)\\&=n^{2}\cdot \left({\frac {1}{1^{2}}}+{\frac {1}{2^{2}}}+\cdots +{\frac {1}{n^{2}}}\right)\\&<{\frac {\pi ^{2}}{6}}n^{2}\end{aligned}}}$

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

Now one can use the Chebyshev inequality to bound the desired probability:

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

Tail estimates

A different upper bound can be derived from the following observation. Let ${\displaystyle {Z}_{i}^{r}}$ denote the event that the ${\displaystyle i}$-th coupon was not picked in the first ${\displaystyle r}$ trials. Then:

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

Thus, for ${\displaystyle r=\beta n\log n}$, we have ${\displaystyle P\left[{Z}_{i}^{r}\right]\leq e^{(-\beta n\log n)/n}=n^{-\beta }}$.

${\displaystyle {\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}}}$

Maps Coupon collector's problem

Extensions and generalizations

• 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.

${\displaystyle \operatorname {P} (T<n\log n+cn)\to e^{-e^{-c}},\ \ {\text{as}}\ n\to \infty .}$

• Donald J. Newman and Lawrence Shepp found 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:

${\displaystyle \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:

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

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

${\displaystyle E(T)=\int _{0}^{\infty }{\big (}1-\prod _{i=1}^{n}(1-e^{-p_{i}t}){\big )}dt.}$

src: classics.understars.org

See also

• Watterson estimator
• Birthday problem

src: blog.mathalicious.com

Notes

src: i.ytimg.com

References

• 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 .
• Newman, Donald J.; Shepp, Lawrence (1960), "The double dixie cup problem", American Mathematical Monthly, 67: 58-61, doi:10.2307/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, MR 1344451 .

src: morethanahomeschoolmom.com

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.

Source of article : Wikipedia