Speed and concentration of the covering time for structured coupon collectors
Let V be an n-set, and let X be a random variable taking values in the power-set of V . Suppose we are given a sequence of random coupons X1 , X2 , ..., where the Xi are independent random variables with distribution given by X. The covering time T is the smallest integer t ≥ 0 such that the union of the first t Xi's equal V . The distribution of T is important in many applications in combinatoria