A Survey of the Coupon Collector’s Problem with Random Sample Sizes

This paper surveys the coupon collector's waiting time problem with random sample sizes and equally likely balls. Consider an urn containing m red balls. For each draw, a random number of balls are removed from the urn. The group of removed balls is painted white and returned to the urn. Several approaches to addressing this problem are discussed, including a Markov chain approach to compute the distribution and expected value of the number of draws required for the urn to contain j white balls given that it currently contains i white balls. As a special case, E[N], the expected number of draws until all the balls are white given that all are currently red is also obtained. [PUBLICATION ABSTRACT]