Waiting times for multiple occurrences of several events
Consider an ‘experiment' which can be repeated indefinitely often resulting in independent random outcomes. Fix attention on a finite number of possible (sets of) outcomes E 1, E 2, … and define W = W(N 1, N 2, …) to be the expected number of repetitions needed to ensure that E 1 has occurred (at least) N 1 times, E 2 has occurred (at least) N 2 times, etc. This article examines the asymptotic behavior of W as a function of the sum Σ j N j, as the latter grows without bound.
1992 ◽
Vol 29
(02)
◽
pp. 255-267
◽
2019 ◽
Vol 2019
(753)
◽
pp. 159-191
◽
2000 ◽
Vol 37
(03)
◽
pp. 756-764
◽
2000 ◽
Vol 37
(3)
◽
pp. 756-764
◽