scientific article; zbMATH DE number 1222155
The authors consider the Markov-Pólya urn model. It is defined as follows. An urn contains a given number of balls of \(N\) different colors. The balls are drawn one at a time successively and independently of each other with equal probabilities. After each draw the ball drawn is replaced by \(c+1\) balls of the same color. The drawing process stops when the frequencies of \(k\) unspecified colors attain some given random levels. Let \(\eta_j\) denote the frequency of balls of \(j\)th color at the stopping time, \(j= 1,2,\dots, n\), and let \(g\) denote a given deterministic function of integer argument. The authors study limiting distributions of decomposable statistics of the form \(L_{Nk}= \sum^N_{j=1} g(\eta_j)\) as \(N\to\infty\) and \(k= k(N)\). For the entire collection see [Zbl 0895.00041].
- Decomposable statistics in inverse urn problems
- scientific article; zbMATH DE number 3858113
- On waiting time in the Markov-Pólya scheme
- A decomposition for Markov processes at an independent exponential time
- scientific article; zbMATH DE number 19246
- scientific article; zbMATH DE number 3988350
- A decomposable branching process in a Markovian environment
- Decomposable statistics and stopping times in sampling without replacement
- Urn models for Markov exchangeability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217656)