Author:
Bandyopadhyay Antar,Janson Svante,Thacker Debleena
Abstract
AbstractWe consider the generalization of the Pólya urn scheme with possibly infinitely many colors, as introduced in [37], [4], [5], and [6]. For countably many colors, we prove almost sure convergence of the urn configuration under the uniform ergodicity assumption on the associated Markov chain. The proof uses a stochastic coupling of the sequence of chosen colors with a branching Markov chain on a weighted random recursive tree as described in [6], [31], and [26]. Using this coupling we estimate the covariance between any two selected colors. In particular, we re-prove the limit theorem for the classical urn models with finitely many colors.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference38 articles.
1. Strong Laws for Urn Models with Balanced Replacement Matrices
2. Exchangeability and related topics
3. Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
4. [17] Flajolet, P. , Dumas, P. and Puyhaubert, V. (2006). Some exactly solvable models of urn process theory. In Fourth Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proc. AG, 59–118.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Positive Reinforced Generalized Time-Dependent Pólya Urns via Stochastic Approximation;Journal of Theoretical Probability;2024-09-04
2. Fluctuations of balanced urns with infinitely many colours;Electronic Journal of Probability;2023-01-01
3. Limits of Pólya urns with innovations;Electronic Journal of Probability;2023-01-01
4. Topological Structure of QWG(f) Set;Advances in Transdisciplinary Engineering;2022-09-22
5. The Research of G-Almost Periodic Point;Advances in Transdisciplinary Engineering;2022-09-22