Search arXivSearch

arXiv · 2012.13218

Functional Central Limit Theorems for Wigner Matrices

Abstract

We consider the fluctuations of regular functions $f$ of a Wigner matrix $W$ viewed as an entire matrix $f(W)$. Going beyond the well studied tracial mode, $\mathrm{Tr}[f(W)]$, which is equivalent to the customary linear statistics of eigenvalues, we show that $\mathrm{Tr}[f(W)]$ is asymptotically normal for any non-trivial bounded deterministic matrix $A$. We identify three different and asymptotically independent modes of this fluctuation, corresponding to the tracial part, the traceless diagonal part and the off-diagonal part of $f(W)$ in the entire mesoscopic regime, where we find that the off-diagonal modes fluctuate on a much smaller scale than the tracial mode. In addition, we determine the fluctuations in the Eigenstate Thermalisation Hypothesis [Deutsch 1991], i.e. prove that the eigenfunction overlaps with any deterministic matrix are asymptotically Gaussian after a small spectral averaging. In particular, in the macroscopic regime our result generalises [Lytova 2013] to complex $W$ and to all crossover ensembles in between. The main technical inputs are the recent multi-resolvent local laws with traceless deterministic matrices from the companion paper [Cipolloni, Erd\H{o}s, Schr\"oder 2020].

Explore related subjects

Keep this discovery

BibTeXRIS

Giorgio Cipolloni, László Erdős, Dominik Schröder. 2020-12-24. Functional Central Limit Theorems for Wigner Matrices. https://arxiv.org/abs/2012.13218

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