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 diag (An,1,...,An,d) be the n-th reinforce matrix. Assuming that EAn,j=EAn,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 for some integer 1