SearcharxivSearch

arXiv · 1904.06065

A Berry-Esse\'en theorem for partial sums of functionals of heavy-tailed moving averages

Abstract

In this paper we obtain Berry-Esse\'en bounds on partial sums of functionals of heavy-tailed moving averages, including the linear fractional stable noise, stable fractional ARIMA processes and stable Ornstein-Uhlenbeck processes. Our rates are obtained for the Wasserstein and Kolmogorov distances, and depend strongly on the interplay between the memory of the process, which is controlled by a parameter $\alpha$, and its tail-index, which is controlled by a parameter $\beta$. In fact, we obtain the classical $\sqrt{1/ n}$ rate of convergence when the tails are not too heavy and the memory is not too strong, more precisely, when $\alpha\beta > 3$ or $\alpha\beta > 4$ in the case of Wasserstein and Kolmogorov distance, respectively. Our quantitative bounds rely on a new second-order Poincare inequality on the Poisson space, which we derive through a combination of Stein's method and Malliavin calculus. This inequality improves and generalizes a result by Last, Peccati, Schulte [Probab. Theory Relat. Fields 165 (2016)].

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Basse-O'Connor, Mark Podolskij, Christoph Thäle. 2019-04-12. A Berry-Esse\'en theorem for partial sums of functionals of heavy-tailed moving averages. https://arxiv.org/abs/1904.06065

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