On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes

DOI10.1007/s10463-016-0578-5zbMath1383.60012OpenAlexW2526488331MaRDI QIDQ1680802

James C. Fu, Wan-Chen Lee

Publication date: 16 November 2017

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10463-016-0578-5

zbMATH Keywords

finite Markov chain imbeddingcoupon collector's problemsDixie cup problems

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (3)

On homogeneous multivariate distributions in random occupancy models and their applications ⋮ Convergence of point processes associated with coupon collector's and Dixie cup problems ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How many samples does it take to see all the balls in an urn?
• How many iid samples does it take to see all the balls in a box?
• On the number of i.i.d. samples required to observe all of the balls in an urn
• The coupon subset collection problem
• The Double Dixie Cup Problem
• Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials
• Distribution Theory of Runs: A Markov Chain Approach
• Dixie cups: sampling with replacement from a finite population

This page was built for publication: On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes