SearcharxivSearch

arXiv · math/0509444

Zero biasing and a discrete central limit theorem

Abstract

We introduce a new family of distributions to approximate $\mathbb {P}(W\in A)$ for $A\subset\{...,-2,-1,0,1,2,...\}$ and $W$ a sum of independent integer-valued random variables $ξ_1$, $ξ_2$, $...,$ $ξ_n$ with finite second moments, where, with large probability, $W$ is not concentrated on a lattice of span greater than 1. The well-known Berry--Esseen theorem states that, for $Z$ a normal random variable with mean $\mathbb {E}(W)$ and variance $\operatorname {Var}(W)$, $\mathbb {P}(Z\in A)$ provides a good approximation to $\mathbb {P}(W\in A)$ for $A$ of the form $(-\infty,x]$. However, for more general $A$, such as the set of all even numbers, the normal approximation becomes unsatisfactory and it is desirable to have an appropriate discrete, nonnormal distribution which approximates $W$ in total variation, and a discrete version of the Berry--Esseen theorem to bound the error. In this paper, using the concept of zero biasing for discrete random variables (cf. Goldstein and Reinert [J. Theoret. Probab. 18 (2005) 237--260]), we introduce a new family of discrete distributions and provide a discrete version of the Berry--Esseen theorem showing how members of the family approximate the distribution of a sum $W$ of integer-valued variables in total variation.

Explore related subjects

Keep this discovery

BibTeXRIS

Larry Goldstein, Aihua Xia. 2006-11-22. Zero biasing and a discrete central limit theorem. https://doi.org/10.1214/009117906000000250

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR