SearcharxivSearch

arXiv · 2007.05717

Sharp connections between Berry-Esseen characteristics and Edgeworth expansions for stationary processes

Abstract

Given a weakly dependent stationary process, we describe the transition between a Berry-Esseen bound and a second order Edgeworth expansion in terms of the Berry-Esseen characteristic. This characteristic is sharp: We show that Edgeworth expansions are valid if and only if the Berry-Esseen characteristic is of a certain magnitude. If this is not the case, we still get an optimal Berry-Esseen bound, thus describing the exact transition. We also obtain (fractional) expansions given $3 < p \leq 4$ moments, where a similar transition occurs. Corresponding results also hold for the Wasserstein metric $W_1$, where a related, integrated characteristic turns out to be optimal. As an application, we establish novel weak Edgeworth expansion and CLTs in $L^p$ and $W_1$. As another application, we show that a large class of high dimensional linear statistics admit Edgeworth expansions without any smoothness constraints, that is, no non-lattice condition or related is necessary. In all results, the necessary weak-dependence assumptions are very mild. In particular, we show that many prominent dynamical systems and models from time series analysis are within our framework, giving rise to many new results in these areas.

Explore related subjects

Keep this discovery

BibTeXRIS

Moritz Jirak, Wei Biao Wu, Ou Zhao. 2020-07-11. Sharp connections between Berry-Esseen characteristics and Edgeworth expansions for stationary processes. https://arxiv.org/abs/2007.05717

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