Related papers: Small deviation estimates for the largest eigenval…
The question of optimally approximating an arbitrary probability measure in the Wasserstein distance by a discrete one with uniform weights is considered. Estimates are obtained for the optimal approximation distance, with an explicit rate…
Let $X$ be an $N$-dimensional random vector which describes the ordered eigenvalues of a $\beta$-Hermite ensemble, and let $z$ the vector containing the ordered zeros of the Hermite poynomial $H_N$. We present an explicit estimate for…
We develop a theory for the eigenvalue density of arbitrary non-Hermitian Euclidean matrices. Closed equations for the resolvent and the eigenvector correlator are derived. The theory is applied to the random Green's matrix relevant to wave…
We consider $N\times N$ Hermitian random matrices with independent identically distributed entries (Wigner matrices). We assume that the distribution of the entries have a Gaussian component with variance $N^{-3/4+\beta}$ for some positive…
The eigenvalue densities of two random matrix ensembles, the Wigner Gaussian matrices and the Wishart covariant matrices, are decomposed in the contributions of each individual eigenvalue distribution. It is shown that the fluctuations of…
We consider large complex random sample covariance matrices obtained from "spiked populations", that is when the true covariance matrix is diagonal with all but finitely many eigenvalues equal to one. We investigate the limiting behavior of…
We consider large non-Hermitian real or complex random matrices $X$ with independent, identically distributed centred entries. We prove that their local eigenvalue statistics near the spectral edge, the unit circle, coincide with those of…
In this paper, we consider directly estimating the eigenvalues of precision matrix, without inverting the corresponding estimator for the eigenvalues of covariance matrix. We focus on a general asymptotic regime, i.e., the large dimensional…
We give a self-contained randomized algorithm based on shifted inverse iteration which provably computes the eigenvalues of an arbitrary matrix $M\in\mathbb{C}^{n\times n}$ up to backward error $\delta\|M\|$ in…
We address the problem of computing the smallest symplectic eigenvalues and the corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem. It is formulated as minimizing a trace cost function…
We give a short, operator-theoretic proof of the asymptotic independence (including a first correction term) of the minimal and maximal eigenvalue of the n \times n Gaussian Unitary Ensemble in the large matrix limit n \to \infty. This is…
We establish sharp large deviation asymptotics for the maximum order statistic of independent and identically distributed heavy-tailed random variables, valid for all Borel subsets of the right tail. This result yields exact decay rates for…
We study the statistics of the largest eigenvalues of real symmetric and sample covariance matrices when the entries are heavy tailed. Extending the result obtained by Soshnikov in \cite{Sos1}, we prove that, in the absence of the fourth…
Concentration inequalities are obtained on Poisson space, for random functionals with finite or infinite variance. In particular, dimension free tail estimates and exponential integrability results are given for the Euclidean norm of…
We study the universality of the local eigenvalue statistics of Gaussian divisible Hermitian Wigner matrices. These random matrices are obtained by adding an independent GUE matrix to an Hermitian random matrix with independent elements, a…
We derive concentration inequalities for functions of the empirical measure of large random matrices with infinitely divisible entries and, in particular, stable ones. We also give concentration results for some other functionals of these…
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, are extended to the case of…
Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications and it is a prerequisite of eigensolvers based on a divide-and-conquer paradigm. Often an…
In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…
The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.