Two poisson limit theorems for the coupon collector’s problem with group drawings
Keyword(s):
AbstractIn the collector’s problem with group drawings, s out of n different types of coupon are sampled with replacement. In the uniform case, each s-subset of the types has the same probability of being sampled. For this case, we derive a Poisson limit theorem for the number of types that are sampled at most $c-1$ times, where $c \ge 1$ is fixed. In a specified approximate nonuniform setting, we prove a Poisson limit theorem for the special case $c=1$ . As corollaries, we obtain limit distributions for the waiting time for c complete series of types in the uniform case and a single complete series in the approximate nonuniform case.
1996 ◽
Vol 33
(01)
◽
pp. 146-155
◽
1983 ◽
Vol 20
(01)
◽
pp. 47-60
◽
Keyword(s):
Keyword(s):
1979 ◽
Vol 16
(02)
◽
pp. 428-432
◽
Keyword(s):
2005 ◽
Vol 42
(2)
◽
pp. 173-194
1979 ◽
Vol 16
(04)
◽
pp. 794-802
◽