Article contents
A generalization of a waiting time problem
Published online by Cambridge University Press: 01 July 2016
Abstract
An urn contains m types of balls of unequal numbers. Let ni be the number of balls of type i, i = 1, 2, …, m. Balls are drawn with replacement until first duplication. In the case of finite memory of order k, the distribution of Ym,k, the number of drawings required, is discussed. Special cases are obtained.
- Type
- Letters to the Editor
- Information
- Copyright
- Copyright © Applied Probability Trust 1990
References
- 6
- Cited by