Asymptotics for randomly reinforced urns with random barriers
Abstract
An urn contains black and red balls. Let Zn be the proportion of black balls at time n and 0≤ L<U≤ 1 random barriers. At each time n, a ball bn is drawn. If bn is black and Zn-1<U, then bn is replaced together with a random number Bn of black balls. If bn is red and Zn-1>L, then bn is replaced together with a random number Rn of red balls. Otherwise, no additional balls are added, and bn alone is replaced. In this paper, we assume Rn=Bn. Then, under mild conditions, it is shown that Zna.s. Z for some random variable Z, and gather* Dn:=n\,(Zn-Z)(0,σ2) a.s. gather* where σ2 is a certain random variance. Almost sure conditional convergence means that gather* P(Dn∈·n)weakly(0,\,σ2).s. gather* where P(Dn∈·n) is a regular version of the conditional distribution of Dn given the past Gn. Thus, in particular, one obtains Dn(0,σ2) stably. It is also shown that L<Z<U a.s. and Z has non-atomic distribution.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.