A Berry-Esseen bound for the uniform multinomial occupancy model
arXiv:1202.0909 · doi:10.1214/EJP.v18-1983
Abstract
The inductive size bias coupling technique and Stein's method yield a Berry-Esseen theorem for the number of urns having occupancy when balls are uniformly distributed over urns. In particular, there exists a constant depending only on 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}{σ_{n,m}} \right) \quad \mbox{for all $n \ge d$ and $m \ge 2$,} $$ where and are the standardized count and variance, respectively, of the number of urns with balls, and is a standard normal random variable. Asymptotically, the bound is optimal up to constants if and tend to infinity together in a way such that stays bounded.
arXiv commentTypo corrected in abstract
References in corpus (8)
- Normal approximation under local dependence
- Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
- Berry Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
- Local limit theorems for finite and infinite urn models
- Stein couplings for normal approximation
- Normal approximation for coverage models over binomial point processes
- A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph
- A Berry Esseen Theorem for the Lightbulb Process