Master of Science in Mathematical Science
First Committee Member
Hokwon Cho, Chair
Second Committee Member
Third Committee Member
Graduate Faculty Representative
Number of Pages
The coupon collection problem is one of the most studied problems in statistics. It is the problem of collecting r (r<∞) distinct coupons one by one from k different kinds (k<∞) of coupons. We note that this is equivalent to the classical occupancy problem which involves the random allocation of r distinct balls into k distinct cells. Although the problem was first introduced centuries ago, it is still actively investigated today. Perhaps its greatest feature is its versatility, numerous approaches, and countless variations. For this reason, we are particularly interested in creating a classification system for the many generalizations of the coupon collection problem. In this thesis, we will introduce models that will be able to categorize these generalizations. In addition, we calculate the waiting time for the models under consideration. Our approach is to use the Dirichlet Type II integral. We compare our calculations to the ones obtained through Monte Carlo simulation. Our results will show that our models and the method used to find the waiting times are ideal for solving problems of this type.
Collection; Coupon; Dirichlet; Integrals; Dirichlet; Monte Carlo method; Probabilities
Probability | Statistics and Probability
University of Nevada, Las Vegas
Lee, James Y., "General coupon collecting models and multinomial games" (2010). UNLV Theses, Dissertations, Professional Papers, and Capstones. 352.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/