Abstract
The inductive size bias coupling technique and Stein's method yield a Berry-Esseen theorem for the number of urns having occupancy $d \ge 2$ when $n$ balls are uniformly distributed over $m$ urns. In particular, there exists a constant $C$ depending only on $d$ such that $$ \sup_{z \in \mathbb{R}}|P(W_{n,m} \le z) -P(Z \le z)| \le C \left( \frac{1+(\frac{n}{m})^3}{\sigma_{n,m}} \right) \quad \mbox{for all $n \ge d$ and $m \ge 2$,} $$ where $W_{n,m}$ and $\sigma_{n,m}^2$ are the standardized count and variance, respectively, of the number of urns with $d$ balls, and $Z$ is a standard normal random variable. Asymptotically, the bound is optimal up to constants if $n$ and $m$ tend to infinity together in a way such that $n/m$ stays bounded.
Highlights
In this paper we provide a Berry-Esseen theorem in the classical occupancy problem for the normal approximation of the distribution of the number of urns having occupancy d when n balls are uniformly distributed among m urns
Since in what follows we focus on the uniform occupancy problem, for notational simplicity we specify the multinomial probability vector by m ∈ N1 rather than by the corresponding vector θm = (1/m, . . . , 1/m, 0, 0, . . .)
The random variables of interest Yn, n ≥ n0 have distributions Lθ(Yn) that depend on a parameter θ in a topological space Θn, endowed with a σ-algebra of subsets
Summary
In this paper we provide a Berry-Esseen theorem in the classical occupancy problem for the normal approximation of the distribution of the number of urns having occupancy d when n balls are uniformly distributed among m urns.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.