On waiting time in the Markov-Pólya scheme
type: Item
instance of: scholarly article
title: On waiting time in the Markov-Pólya scheme
zbMATH Open document ID: 0912.60062
DOI: 10.1007/BF02432862
author: G. I. Ivchenko
author: O. V. Ivanov
published in: Journal of Mathematical Sciences (New York)
publication date: 1998-12-09T00:00:00Z
review text: Balls are sequentially drawn from an urn with balls of \(N\) different colours. After each draw a ball is returned together with \(c\) of the same colour (here \(c\) is \(-1\) or a non-negative integer), i.e. a Markov-Pólya urn scheme. The drawing stops when the number of balls of \(k\) unspecified colours attain or exceed specified levels (allowed to be random). Limit distributions for the number of drawn balls are derived by inverting results when a fixed number of balls are drawn.
reviewed by: Lars Holst
Mathematics Subject Classification ID: 60G40
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 1230315
zbMATH Keywords: limit theorems
zbMATH Keywords: urn schemes
MaRDI profile type: Publication
cites work: Q3241504
cites work: Q4208987
cites work: Q5825219
cites work: Decomposable statistics in an inverse allocation problem
cites work: The waiting time and related statistics in the multinomial scheme: a survey
cites work: Decomposable statistics in inverse urn problems
cites work: Decomposable statistics and stopping times in sampling without replacement
cites work: Sequential urn schemes and birth processes
cites work: On Interchanging Limits and Integrals
cites work: Limit theorems in an allocation scheme with random levels
description: scientific article; zbMATH DE number 1230315