Sequential urn schemes and birth processes

Lars Holst; Jürg Hüsler

doi:10.2307/1427140

journal article Jun 01, 1985

Sequential urn schemes and birth processes

Lars Holst Jürg Hüsler

Advances in Applied Probability Vol. 17 No. 2 pp. 257-279 · Cambridge University Press (CUP)

View at Publisher Save 10.2307/1427140

Abstract

An urn contains balls of different colours, which are randomly drawn one at a time. After each draw the number of balls in the urn with the same colour as the ball last drawn is changed. Special cases are sampling with and without replacement, and Pólya sampling. The drawing stops when a given number of colours has been drawn a given number of times. The number of times the different colours have been drawn is studied in this paper by imbedding the urn scheme in birth processes. Both exact and asymptotic results are obtained. In particular, waiting times for sampling with and without replacement and for Pólya sampling are considered.

Topics

No keywords indexed for this article. Browse by subject →

References

11

[1]

10.1017/s0021900200098089

[2]

Feller (1966)

[3]

Feller (1957)

[4]

David (1980)

[5]

Békéssy "On classical occupany problems II (sequential occupancy)" Magy. Tud. Akad. Mat. Kutató. Int. Közl. (1964)

[6]

10.2307/3314900

[7]

Johnson (1977)

[8]

10.1002/9780470316436

[9]

10.1214/aop/1176996669

[10]

10.2307/3213891

[11]

10.2307/3213383

Metrics

5

Citations

11

References

Details

Published: Jun 01, 1985
Vol/Issue: 17(2)
Pages: 257-279
License: View

Authors

Cite This Article

Lars Holst, Jürg Hüsler (1985). Sequential urn schemes and birth processes. Advances in Applied Probability, 17(2), 257-279. https://doi.org/10.2307/1427140

Sequential urn schemes and birth processes

You May Also Like