Search arXivSearch

arXiv · 1912.08856

Partial linear eigenvalue statistics for non-Hermitian random matrices

Abstract

For an $n \times n$ independent-entry random matrix $X_n$ with eigenvalues $\lambda_1, \ldots, \lambda_n$, the seminal work of Rider and Silverstein asserts that the fluctuations of the linear eigenvalue statistics $\sum_{i=1}^n f(\lambda_i)$ converge to a Gaussian distribution for sufficiently nice test functions $f$. We study the fluctuations of $\sum_{i=1}^{n-K} f(\lambda_i)$, where $K$ randomly chosen eigenvalues have been removed from the sum. In this case, we identify the limiting distribution and show that it need not be Gaussian. Our results hold for the case when $K$ is fixed as well as the case when $K$ tends to infinity with $n$. The proof utilizes the predicted locations of the eigenvalues introduced by E. Meckes and M. Meckes. As a consequence of our methods, we obtain a rate of convergence for the empirical spectral distribution of $X_n$ to the circular law in Wasserstein distance, which may be of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Sean O'Rourke, Noah Williams. 2019-12-18. Partial linear eigenvalue statistics for non-Hermitian random matrices. https://arxiv.org/abs/1912.08856

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