English

Small counts in the infinite occupancy scheme

Probability 2008-09-26 v1

Abstract

The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which nn balls are thrown independently into boxes 1,2,...1,2,..., with probability pjp_j of hitting the box jj, where p1p2...>0p_1\geq p_2\geq...>0 and j=1pj=1\sum_{j=1}^\infty p_j=1. We establish joint normal approximation as nn\to\infty for the numbers of boxes containing r1,r2,...,rmr_1,r_2,...,r_m balls, standardized in the natural way, assuming only that the variances of these counts all tend to infinity. The proof of this approximation is based on a de-Poissonization lemma. We then review sufficient conditions for the variances to tend to infinity. Typically, the normal approximation does not mean convergence. We show that the convergence of the full vector of rr-counts only holds under a condition of regular variation, thus giving a complete characterization of possible limit correlation structures.

Keywords

Cite

@article{arxiv.0809.4387,
  title  = {Small counts in the infinite occupancy scheme},
  author = {A. D. Barbour and A. V. Gnedin},
  journal= {arXiv preprint arXiv:0809.4387},
  year   = {2008}
}
R2 v1 2026-06-21T11:24:07.662Z