paper

Central Limit Theorems for Multicolor Urns with Dominated Colors

arXiv:0907.0676

Abstract

An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some statistical applications are discussed.

preprint, 17 pages

Central Limit Theorems for Multicolor Urns with Dominated Colors · wovepaper