Related papers: Localization and delocalization of eigenvectors fo…
In this work we consider deterministic, symmetric matrices with heavy-tailed noise imposed on entries within a fixed distance $K$ to the diagonal. The most important example is discrete 1d random Schr\"odinger operator defined on…
The spectrum of the nonbacktracking matrix associated to a network is known to contain fundamental information regarding percolation properties of the network. Indeed, the inverse of its leading eigenvalue is often used as an estimate for…
We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials…
We study the statistics of the local resolvent and non-ergodic properties of eigenvectors for a generalised Rosenzweig-Porter $N\times N$ random matrix model, undergoing two transitions separated by a delocalised non-ergodic phase.…
We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with…
We study the statistics of eigenvectors in correlated random band matrix models. These models are characterized by two parameters, the band width B(N) of a Hermitian N times N matrix and the correlation parameter C(N) describing…
The spectral properties of the adjacency matrix provide a trove of information about the structure and function of complex networks. In particular, the largest eigenvalue and its associated principal eigenvector are crucial in the…
We consider a class of random permutations of the interval $[-n,n]$, in which points are typically displaced a distance $O(W)$. We show the cycles are localized on the scale $W^3$, with an exponentially decaying tail bound. Analogous to…
We consider the real eigenvalues of an $(N \times N)$ real elliptic Ginibre matrix whose entries are correlated through a non-Hermiticity parameter $\tau_N\in [0,1]$. In the almost-Hermitian regime where $1-\tau_N=\Theta(N^{-1})$, we obtain…
We consider the eigenvalues and eigenvectors of finite, low rank perturbations of random matrices. Specifically, we prove almost sure convergence of the extreme eigenvalues and appropriate projections of the corresponding eigenvectors of…
In this paper, we consider the universality of the local eigenvalue statistics of random matrices. Our main result shows that these statistics are determined by the first four moments of the distribution of the entries. As a consequence, we…
We study the overlaps between right and left eigenvectors for random matrices of the spherical and truncated unitary ensembles. Conditionally on all eigenvalues, diagonal overlaps are shown to be distributed as a product of independent…
We study the eigenvectors of generalized Wigner matrices with subexponential entries and prove that they delocalize at the optimal rate with overwhelming probability. We also prove high probability delocalization bounds with sharp…
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…
We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…
We investigate the spectral properties of non-Hermitian real random matrices whose entries exhibit long-range correlations decaying as~$|r-r'|^{-\alpha}$. We find a progressive breakdown of the circular law, controlled by the decrease…
We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $\alpha$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by…