Strong convergence of infinite color balanced urns under uniform ergodicity
From MaRDI portal
Publication:5139907
Abstract: We consider the generalization of the P'olya urn scheme with possibly infinite many colors as introduced in cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors, we prove almost sure convergence of the urn configuration under emph{uniform ergodicity} assumption on the associated Markov chain. The proof uses a stochastic coupling of the sequence of chosen colors with a emph{branching Markov chain} on a weighted emph{random recursive tree} as described in cite{BaTh2017, Sv_2018}. Using this coupling we estimate the covariance between any two selected colors. In particular, we reprove the limit theorem for the classical urn models with finitely many colors.
Recommendations
- Rate of convergence and large deviation for the infinite color Pólya urn schemes
- Rates of convergence for balanced irreducible two-color Pólya urns
- A.s. convergence for infinite colour Pólya urns associated with random walks
- Fluctuations of balanced urns with infinitely many colours
- Strong limit theorems in the multi-color generalized allocation scheme
- Strong convergence of ρ˜-mixing random sequences
- scientific article; zbMATH DE number 4174000
- On the distribution of the limit proportion for a two-color, randomly reinforced urn with equal reinforcement distributions
- scientific article; zbMATH DE number 4090452
- Central limit theorems for multicolor urns with dominated colors
Cites work
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A Bayesian analysis of some nonparametric problems
- A new two-urn model
- A survey of random processes with reinforcement
- Asymptotics in randomized urn models
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- Ferguson distributions via Polya urn schemes
- From GEM back to Dirichlet via Hoppe's Urn
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Limit theorems for triangular urn schemes
- Markov Chains and Stochastic Stability
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Measure-valued Pólya urn processes
- Multicolor urn models with reducible replacement matrices
- Non-negative matrices and Markov chains.
- On generalized Pólya urn models
- On the central limit theorem for geometrically ergodic Markov chains
- Pólya urn schemes with infinitely many colors
- Pólya-like urns and the Ewens' sampling formula
- Random Trees
- Random replacements in Pólya urns with infinitely many colours
- Randomized urn models revisited using stochastic approximation
- Rate of convergence and large deviation for the infinite color Pólya urn schemes
- Some exactly solvable models of urn process theory
- Strong Laws for Balanced Triangular Urns
- Strong convergence of proportions in a multicolor Pólya urn
- Strong laws for urn models with balanced replacement matrices
- Strong laws of large numbers for weakly correlated random variables
- The Number of Two Consecutive Successes in a Hoppe-Pólya Urn
- The asymptotic behavior of an urn model arising
- The dominating colour of an infinite Pólya urn model
- The sampling theory of neutral alleles and an urn model in population genetics
Cited in
(15)- On maximal quantity of particles of one color in analogs of multicolor urn schemes
- Rate of convergence and large deviation for the infinite color Pólya urn schemes
- Limits of Pólya urns with innovations
- scientific article; zbMATH DE number 4174000 (Why is no real title available?)
- scientific article; zbMATH DE number 4090452 (Why is no real title available?)
- Rates of convergence for balanced irreducible two-color Pólya urns
- Strong limit theorems in the multi-color generalized allocation scheme
- Strong laws for urn models with balanced replacement matrices
- A.s. convergence for infinite colour Pólya urns associated with random walks
- Coupling any number of balls in the infinite-bin model
- Fluctuations of balanced urns with infinitely many colours
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- Positive reinforced generalized time-dependent Pólya urns via stochastic approximation
- Pólya urn schemes with infinitely many colors
- A new approach to Pólya urn schemes and its infinite color generalization
This page was built for publication: Strong convergence of infinite color balanced urns under uniform ergodicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139907)