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 EA_n,j=EA_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 EA_n,j = EA_n,1 whenever n ≥ 1 and 1 ≤ j ≤ d_0 , liminfn EA_n,1 > limsup_n EA_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.