Small counts in the infinite occupancy scheme
| dc.creator | Barbour, A. D. | |
| dc.creator | Gnedin, A. V. | |
| dc.date | 2008-09-25 | |
| dc.date.accessioned | 2026-07-07T10:05:16Z | |
| dc.date.available | 2026-07-07T10:05:16Z | |
| dc.description | The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which $n$ balls are thrown independently into boxes $1,2,...$, with probability $p_j$ of hitting the box $j$, where $p_1\geq p_2\geq...>0$ and $\sum_{j=1}^\infty p_j=1$. We establish joint normal approximation as $n\to\infty$ for the numbers of boxes containing $r_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 $r$-counts only holds under a condition of regular variation, thus giving a complete characterization of possible limit correlation structures. | |
| dc.identifier | https://arxiv.org/abs/0809.4387 | |
| dc.identifier | http://arxiv.org/abs/0809.4387 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169963 | |
| dc.subject | Probability | |
| dc.subject | 60F05, 60F15 | |
| dc.title | Small counts in the infinite occupancy scheme | |
| dc.type | text |