Abstract:
In [5] we derived a generalization of a waiting time problem until first duplication of order k with finite memory of order k as follows: Suppose that an urn contains m different types of unequal numbers of balls. Balls are drawn with replacement until first duplication. In the case of finite memory of order k, let ym3( be the number of drawings required. In this paper the distribution of Ym'k is discussed in two cases. The moments and the factorial moments of Yrn'm is obtained. Moreover some special cases are obtained. Finally an application is given.
Page(s):
303-309
DOI:
DOI not available
Published:
Journal: Proceedings of Pakistan Academy of Sciences, Volume: 27, Issue: 4, Year: 1990