Small counts in the infinite occupancy scheme
A.D. Barbour, A.V. Gnedin

TL;DR
This paper investigates the distribution of small counts in an infinite occupancy scheme, establishing joint normal approximation for counts with minimal variance assumptions and characterizing conditions for convergence.
Contribution
It provides the first joint normal approximation for small counts in the infinite occupancy scheme under broad variance conditions and characterizes when convergence occurs.
Findings
Joint normal approximation holds when variances tend to infinity.
Convergence of counts depends on regular variation conditions.
Complete characterization of limit correlation structures.
Abstract
The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which balls are thrown independently into boxes , with probability of hitting the box , where and . We establish joint normal approximation as for the numbers of boxes containing 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 -counts only holds under a condition of regular variation, thus giving a complete characterization of possible limit correlation structures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Random Matrices and Applications · Markov Chains and Monte Carlo Methods
