Central limit theorems for multicolor urns with dominated colors

An urn contains balls of d ≥ 2 colors. At each time n ≥ 1 , a ball is drawn and then replaced together with a random number of balls of the same color. Let A n = diag ( A n , 1 , … , A n , d ) be the n -th reinforce matrix. Assuming that E A n , j = E A n , 1 for all n and j , a few central limit theorems (CLTs) are available for such urns. In real problems, however, it is more reasonable to assume that E A n , j = E A n , 1 whenever  n ≥ 1  and  1 ≤ j ≤ d 0 , lim inf n E A n , 1 > lim sup n E A n , j whenever  j > d 0 , for some integer 1 ≤ d 0 ≤ d . Under this condition, the usual weak limit theorems may fail, but it is still possible to prove the CLTs for some slightly different random quantities. These random quantities are obtained by neglecting dominated colors, i.e., colors from d 0 + 1 to d , and they allow the same inference on the urn structure. The sequence ( A n : n ≥ 1 ) is independent but need not be identically distributed. Some statistical applications are given as well.