Search arXivSearch

arXiv · 1301.2828

On the nonuniform Berry--Esseen bound

Abstract

Due to the effort of a number of authors, the value c_u of the absolute constant factor in the uniform Berry--Esseen (BE) bound for sums of independent random variables has been gradually reduced to 0.4748 in the iid case and 0.5600 in the general case; both these values were recently obtained by Shevtsova. On the other hand, Esseen had shown that c_u cannot be less than 0.4097. Thus, the gap factor between the best known upper and lower bounds on (the least possible value of) c_u is now rather close to 1. The situation is quite different for the absolute constant factor c_{nu} in the corresponding nonuniform BE bound. Namely, the best correctly established upper bound on c_{nu} in the iid case is about 25 times the corresponding best known lower bound, and this gap factor is greater than 30 in the general case. In the present paper, improvements to the prevailing method (going back to S. Nagaev) of obtaining nonuniform BE bounds are suggested. Moreover, a new method is presented, of a rather purely Fourier kind, based on a family of smoothing inequalities, which work better in the tail zones. As an illustration, a quick proof of Nagaev's nonuniform BE bound is given. Some further refinements in the application of the method are shown as well.

Explore related subjects

Keep this discovery

BibTeXRIS

Iosif Pinelis. 2013-05-08. On the nonuniform Berry--Esseen bound. https://arxiv.org/abs/1301.2828

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