SearcharxivSearch

arXiv · 1510.03616

An invariance principle for stochastic series I. Gaussian limits

Abstract

We study invariance principles and convergence to a Gaussian limit for stochastic series of the form $S(c,Z)=\sum_{m=1}^{\infty }\sum_{α_{1}<...<α_{m}}c(α_{1},...,α_{m})\prod_{i=1}^{m}Z_{α_{i}}$ where $Z_{k}$, $k\in \mathbb{N}$, is a sequence of centred independent random variables of unit variance. In the case when the $Z_{k}$'s are Gaussian, $S(c,Z)$ is an element of the Wiener chaos and convergence to a Gaussian limit (so the corresponding nonlinear CLT) has been intensively studied by Nualart, Peccati, Nourdin and several other authors. The invariance principle consists in taking $Z_{k}$ with a general law. It has also been considered in the literature, starting from the seminal papers of Jong, and a variety of applications including $U$-statistics are of interest. Our main contribution is to study the convergence in total variation distance and to give estimates of the error.

Explore related subjects

Keep this discovery

BibTeXRIS

Vlad Bally, Lucia Caramellino. 2015-10-13. An invariance principle for stochastic series I. Gaussian limits. https://arxiv.org/abs/1510.03616

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