Suppose an urn contains m distinct coupons, labeled from 1 to m. A random sample of k coupons is drawn without replacement from the urn, numbers are recorded and the coupons are then returned to the urn. This procedure is done repeatedly and the sample sizes are independently identically distributed. Let W be the total number of random samples needed to see all coupons at least l times $$(l \ge 1)$$ ( l ≥ 1 ) . Recently, for $$l=1$$ l = 1 , the approximation for the first moment of the random variable W has been studied under random sample size sampling scheme by Sellke (Ann Appl Probab, 5:294–309, 1995). In this manuscript, we focus on studying the exact distributions of waiting times W for both fixed and random sample size sampling schemes given $$l \ge 1$$ l ≥ 1 . The results are further extended to a combination of fixed and random sample size sampling procedures.
Annals of the Institute of Statistical Mathematics – Springer Journals
Published: Aug 9, 2016
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera