SearcharxivSearch

arXiv · 1009.3949

Wigner chaos and the fourth moment

Abstract

We prove that a normalized sequence of multiple Wigner integrals (in a fixed order of free Wigner chaos) converges in law to the standard semicircular distribution if and only if the corresponding sequence of fourth moments converges to 2, the fourth moment of the semicircular law. This extends to the free probabilistic, setting some recent results by Nualart and Peccati on characterizations of central limit theorems in a fixed order of Gaussian Wiener chaos. Our proof is combinatorial, analyzing the relevant noncrossing partitions that control the moments of the integrals. We can also use these techniques to distinguish the first order of chaos from all others in terms of distributions; we then use tools from the free Malliavin calculus to give quantitative bounds on a distance between different orders of chaos. When applied to highly symmetric kernels, our results yield a new transfer principle, connecting central limit theorems in free Wigner chaos to those in Gaussian Wiener chaos. We use this to prove a new free version of an important classical theorem, the Breuer-Major theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Todd Kemp, Ivan Nourdin, Giovanni Peccati, Roland Speicher. 2010-09-20. Wigner chaos and the fourth moment. https://doi.org/10.1214/11-aop657

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