SearcharxivSearch

arXiv · 2001.07661

Central limit theorem for mesoscopic eigenvalue statistics of the free sum of matrices

Abstract

We consider random matrices of the form $H_N=A_N+U_N B_N U^*_N$, where $A_N$, $B_N$ are two $N$ by $N$ deterministic Hermitian matrices and $U_N$ is a Haar distributed random unitary matrix. We establish a universal Central Limit Theorem for the linear eigenvalue statistics of $H_N$ on all mesoscopic scales inside the regular bulk of the spectrum. The proof is based on studying the characteristic function of the linear eigenvalue statistics, and consists of two main steps: (1) generating Ward identities using the left-translation-invariance of the Haar measure, along with a local law for the resolvent of $H_N$ and analytic subordination properties of the free additive convolution, allow us to derive an explicit formula for the derivative of the characteristic function; (2) a local law for two-point product functions of resolvents is derived using a partial randomness decomposition of the Haar measure. We also prove the corresponding results for orthogonal conjugations.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhigang Bao, Kevin Schnelli, Yuanyuan Xu. 2020-01-21. Central limit theorem for mesoscopic eigenvalue statistics of the free sum of matrices. https://arxiv.org/abs/2001.07661

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