Approximation Theorems Related to the Coupon Collector's Problem

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same probability $1/n$. For a fixed integer $m\in\{0,1,...,n-1\}$, the coupon collector's waiting time $W_{n,m}$ is the random number of draws the collector performs until he acquires $n-m$ distinct coupons for the first time. The basic goal of the thesis is to approximate the distribution of the coupon collector's appropriately centered and normalized waiting time with well-known measures with high accuracy, and in many cases prove asymptotic expansions for the related probability distribution functions and mass functions. The approximating measures are chosen from five different measure families. Three of them -- the Poisson distributions, the normal distributions and the Gumbel-like distributions -- are probability measure families whose members occur as limiting laws in the limit theorems concerning $W_{n,m}$. The other two approximating measure families are certain compound Poisson distributions and Poisson--Charlier signed measures.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Approximation Theorems Related to the Coupon Collector's Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation Theorems Related to the Coupon Collector's Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation Theorems Related to the Coupon Collector's Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-552667

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.