SearcharxivSearch

arXiv · 1210.5666

Regularity conditions in the CLT for linear eigenvalue statistics of Wigner matrices

Abstract

We show that the variance of centred linear statistics of eigenvalues of GUE matrices remains bounded for large $n$ for some classes of test functions less regular than Lipschitz functions. This observation is suggested by the limiting form of the variance (which has previously been computed explicitly), but it does not seem to appear in the literature. We combine this fact with comparison techniques following Tao-Vu and Erdös, Yau, et al. and a Littlewood-Paley type decomposition to extend the central limit theorem for linear eigenvalue statistics to functions in the Hölder class $C^{1/2+ε}$ in the case of matrices of Gaussian convolution type. We also give a variance bound which implies the CLT for test functions in the Sobolev space $H^{1+ε}$ and $C^{1-ε}$ for general Wigner matrices satisfying moment conditions. Previous results on the CLT impose the existence and continuity of at least one classical derivative.

Explore related subjects

Keep this discovery

BibTeXRIS

Philippe Sosoe, Percy Wong. 2015-10-05. Regularity conditions in the CLT for linear eigenvalue statistics of Wigner matrices. https://doi.org/10.1016/j.aim.2013.09.004

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