arXiv Analytics

Sign in

arXiv:0710.1520 [math.PR]AbstractReferencesReviewsResources

Multicolor urn models with reducible replacement matrices

Arup Bose, Amites Dasgupta, Krishanu Maulik

Published 2007-10-08, updated 2009-02-09Version 3

Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three- and four-color urns, we derive the asymptotic behavior of linear combinations of the number of balls. In particular, we show that certain linear combinations of the balls of different colors have limiting distributions which are variance mixtures of normal distributions. We also obtain almost sure limits in certain cases in contrast to the corresponding irreducible cases, where only weak limits are known.

Comments: Published in at http://dx.doi.org/10.3150/08-BEJ150 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)
Journal: Bernoulli 2009, Vol. 15, No. 1, 279-295
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:0905.4230 [math.PR] (Published 2009-05-26, updated 2009-09-15)
On characterizations based on regression of linear combinations of record values
arXiv:0709.3184 [math.PR] (Published 2007-09-20)
Distribution functions of linear combinations of lattice polynomials from the uniform distribution
arXiv:1311.4243 [math.PR] (Published 2013-11-18, updated 2016-01-17)
Collision Times in Multicolor Urn Models and Sequential Graph Coloring With Applications to Discrete Logarithms