Penrose, Mathew D. Normal approximation for isolated balls in an urn allocation model. (English) Zbl 1191.60029 Electron. J. Probab. 14, 2155-2181 (2009). Summary: Consider throwing \(n\) balls at random into \(m\) urns, each ball landing in urn \(i\) with probability \(p(i)\). Let \(S\) be the resulting number of singletons, i.e., urns containing just one ball. We give an error bound for the Kolmogorov distance from the distribution of \(S\) to the normal, and estimates on its variance. These show that if \(n, m\) and \((p(i))\) vary in such a way that n \(p(i)\) remains bounded uniformly in \(n\) and \(i\), then \(S\) satisfies a CLT if and only if (\(n\) squared) times the sum of the squares of the entries \(p(i)\) tends to infinity, and demonstrate an optimal rate of convergence in the CLT in this case. In the uniform case with all \(p(i)\) equal and with \(m\) and \(n\) growing proportionately, we provide bounds with better asymptotic constants. The proof of the error bounds is based on Stein’s method via size-biased couplings. Cited in 2 Documents MSC: 60F05 Central limit and other weak theorems 60C05 Combinatorial probability Keywords:Berry-Esseen bound; central limit theorem; occupancy scheme; size biased coupling; Stein’s method PDFBibTeX XMLCite \textit{M. D. Penrose}, Electron. J. Probab. 14, 2155--2181 (2009; Zbl 1191.60029) Full Text: DOI arXiv EuDML EMIS