On waiting time in the Markov-Pólya scheme (Q1273362): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1645194
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Alexander V. Ivanov / rank
 
Normal rank

Revision as of 05:56, 29 February 2024

scientific article
Language Label Description Also known as
English
On waiting time in the Markov-Pólya scheme
scientific article

    Statements

    On waiting time in the Markov-Pólya scheme (English)
    0 references
    0 references
    0 references
    9 December 1998
    0 references
    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.
    0 references
    0 references
    limit theorems
    0 references
    urn schemes
    0 references

    Identifiers