SearcharxivSearch

arXiv · 1009.1310

On the Gaussian approximation of vector-valued multiple integrals

Abstract

By combining the findings of two recent, seminal papers by Nualart, Peccati and Tudor, we get that the convergence in law of any sequence of vector-valued multiple integrals $F_n$ towards a centered Gaussian random vector $N$, with given covariance matrix $C$, is reduced to just the convergence of: $(i)$ the fourth cumulant of each component of $F_n$ to zero; $(ii)$ the covariance matrix of $F_n$ to $C$. The aim of this paper is to understand more deeply this somewhat surprising phenomenom. To reach this goal, we offer two results of different nature. The first one is an explicit bound for $d(F,N)$ in terms of the fourth cumulants of the components of $F$, when $F$ is a $\R^d$-valued random vector whose components are multiple integrals of possibly different orders, $N$ is the Gaussian counterpart of $F$ (that is, a Gaussian centered vector sharing the same covariance with $F$) and $d$ stands for the Wasserstein distance. The second one is a new expression for the cumulants of $F$ as above, from which it is easy to derive yet another proof of the previously quoted result by Nualart, Peccati and Tudor.

Explore related subjects

Keep this discovery

BibTeXRIS

Salim Noreddine, Ivan Nourdin. 2010-09-07. On the Gaussian approximation of vector-valued multiple integrals. https://arxiv.org/abs/1009.1310

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