coupon collector's problem

The coupon collector's problem can be solved in several different ways.

However, according to the coupon collector's problem, edges are needed in order to have high probability that the whole random graph is connected.

In probability theory, the coupon collector's problem describes the "collect all coupons and win" contests.

Asymptotic distributions for the coupon collector's problem.

Another combinatorial technique can also be used to resolve the problem: see Coupon collector's problem (generating function approach).

Coupon collector's problem (generating function approach) / gmb (F:D)

Donald J. Newman and Lawrence Shepp found a generalization of the coupon collector's problem when k copies of each coupon needs to be collected.

This is vaguely comparable to the coupon collector's problem, where the process involves "collecting" (by sampling with replacement) a set of X coupons until each coupon has been seen at least once.

Using the Coupon collector's problem in probability theory, it can be shown that it takes, on average, 72 outcomes of the Magic 8 Ball for all 20 of its answers to appear at least once.

Using a fixed-rate erasure code, a receiver missing a source symbol (due to a transmission error) faces the coupon collector's problem: it must successfully receive an encoding symbol which it does not already have.