Online Program Home
  My Program

All Times EDT

Abstract Details

Activity Number: 243 - Statistics in Sports and Beyond
Type: Contributed
Date/Time: Wednesday, August 11, 2021 : 10:00 AM to 11:50 AM
Sponsor: Section on Teaching of Statistics in the Health Sciences
Abstract #317963
Title: A Markov Chain Approach to Coupon Collector's Problem
Author(s): ILHAN M. IZMIRLI*
Companies: 5559500017
Keywords: Coupon Collectors Problem; Geometric Distributions; Markov Chains

The coupon collector’s problem (CCP), a well-known problem in classical combinatorial probability, can be stated as follows: Suppose there exists n different types of objects and we wish to accumulate all n of these. What is the expected number of objects we need to collect to obtain the complete collection? As is well known, under the assumptions 1.At each trial, an object is chosen at random, 2. Each object is equally likely to be chosen, 3. The choices are independent

this problem can be solved easily by the use of geometric distributions. In this paper, we will show how to apply Markov chains to obtain the solution of CCP. The advantage of this approach is that it yields itself easily to the solution of the generalized problem where condition (2) above is dropped.

Authors who are presenting talks have a * after their name.

Back to the full JSM 2021 program