2020
DOI: 10.1017/jpr.2020.37
|View full text |Cite
|
Sign up to set email alerts
|

Strong convergence of infinite color balanced urns under uniform ergodicity

Abstract: We 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 bet… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 36 publications
(78 reference statements)
0
12
0
Order By: Relevance
“…In Theorem 2.13(3), the situation is similar to Theorem 2.13 (2). The characterization is more technical, partly because the limit distribution now also depends on the initial values m 0 ; we give several equivalent conditions.…”
Section: Model and Main Resultsmentioning
confidence: 94%
See 3 more Smart Citations
“…In Theorem 2.13(3), the situation is similar to Theorem 2.13 (2). The characterization is more technical, partly because the limit distribution now also depends on the initial values m 0 ; we give several equivalent conditions.…”
Section: Model and Main Resultsmentioning
confidence: 94%
“…and hence it is sufficient to prove (2.33) for f − Π ∆ ′ f instead of f . In other words, in (2) we may assume that…”
Section: Proof Of Theorem 210mentioning
confidence: 99%
See 2 more Smart Citations
“…Urn models with infinitely many colors were treated in [5,6,18]. In [6] the authors introduce a class of balanced urn schemes with infinitely many colors indexed by Z d where the replacement schemes are given by the transition matrices associated with bounded increment random walks.…”
Section: Introductionmentioning
confidence: 99%