Translator Disclaimer
2011 Strong Laws for Urn Models with Balanced Replacement Matrices
Amites Dasgupta, Krishanu Maulik
Author Affiliations +
Electron. J. Probab. 16: 1723-1749 (2011). DOI: 10.1214/EJP.v16-928


We consider an urn model, whose replacement matrix has all entries nonnegative and is balanced, that is, has constant row sums. We obtain the rates of the counts of balls corresponding to each color for the strong laws to hold. The analysis requires a rearrangement of the colors in two steps. We first reduce the replacement matrix to a block upper triangular one, where the diagonal blocks are either irreducible or the scalar zero. The scalings for the color counts are then given inductively depending on the Perron-Frobenius eigenvalues of the irreducible diagonal blocks. In the second step of the rearrangement, the colors are further rearranged to reduce the block upper triangular replacement matrix to a canonical form. Under a further mild technical condition, we obtain the scalings and also identify the limits. We show that the limiting random variables corresponding to the counts of colors within a block are constant multiples of each other. We provide an easy-to-understand explicit formula for them as well. The model considered here contains the urn models with irreducible replacement matrix, as well as, the upper triangular one and several specific block upper triangular ones considered earlier in the literature and gives an exhaustive picture of the color counts in the general case with only possible restrictions that the replacement matrix is balanced and has nonnegative entries.


Download Citation

Amites Dasgupta. Krishanu Maulik. "Strong Laws for Urn Models with Balanced Replacement Matrices." Electron. J. Probab. 16 1723 - 1749, 2011.


Accepted: 19 September 2011; Published: 2011
First available in Project Euclid: 1 June 2016

zbMATH: 1244.60031
MathSciNet: MR2835252
Digital Object Identifier: 10.1214/EJP.v16-928

Primary: 60F15
Secondary: 60F25, 60G42


Vol.16 • 2011
Back to Top