pith. sign in

arxiv: 1801.02380 · v1 · pith:4DJCUFRPnew · submitted 2018-01-08 · 🧮 math.PR

Generalized P\'olya Urn Schemes with Negative but Linear Reinforcements

classification 🧮 math.PR
keywords configurationemphlimitalmostcolourcolourscountsestablish
0
0 comments X
read the original abstract

In this paper, we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the \emph{negatively reinforced} urn scheme. We establish almost sure limit of the random configuration for any \emph{balanced} replacement matrix $R$. In particular, we show that the limiting configuration is uniform on the set of colours, if and only if, $R$ is a \emph{doubly stochastic} matrix. We further establish almost sure limit of the vector of colour counts and prove central limit theorems for the random configuration, as well as, for the colour counts.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.