Related papers: Eigenvector Statistics of L\'{e}vy Matrices

In this paper we establish eigenvector delocalization and bulk universality for L\'{e}vy matrices, which are real, symmetric, $N \times N$ random matrices $\textbf{H}$ whose upper triangular entries are independent, identically distributed…

This work provide a thorough study of L\'evy or heavy-tailed random matrices (LM). By analysing the self-consistent equation on the probability distribution of the diagonal elements of the resolvent we establish the equation determining the…

We discuss non-Gaussian random matrices whose elements are random variables with heavy-tailed probability distributions. In probability theory heavy tails of the distributions describe rare but violent events which usually have dominant…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

Using the theory of free random variables (FRV) and the Coulomb gas analogy, we construct stable random matrix ensembles that are random matrix generalizations of the classical one-dimensional stable L\'{e}vy distributions. We show that the…

We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graph ${\bf G}(N,p)$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that the non-trivial edge eigenvectors are asymptotically jointly normal.…

We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erd\H{o}s-R\'enyi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the…

This article focuses on linear eigenvalue statistics of Hankel matrices with independent entries. Using the convergence of moments we show that the linear eigenvalue statistics of Hankel matrices for odd degree monomials with degree greater…

We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries…

We study the angles between the eigenvectors of a random $n\times n$ complex matrix $M$ with density $\propto \mathrm{e}^{-n\operatorname{Tr}V(M^*M)}$ and $x\mapsto V(x^2)$ convex. We prove that for unit eigenvectors…

We study heavy-tailed Hermitian random matrices that are unitarily invariant. The invariance implies that the eigenvalue and eigenvector statistics are decoupled. The motivating question has been whether a freely stable random matrix has…

We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured…

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…

Statistical properties of eigenvectors in non-Hermitian random matrix ensembles are discussed, with an emphasis on correlations between left and right eigenvectors. Two approaches are described. One is an exact calculation for Ginibre's…

We study statistical properties of the eigenvectors of non-Hermitian random matrices, concentrating on Ginibre's complex Gaussian ensemble, in which the real and imaginary parts of each element of an N x N matrix, J, are independent random…

The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…

In contrast to the neatly bounded spectra of densely populated large random matrices, sparse random matrices often exhibit unbounded eigenvalue tails on the real and imaginary axis, called Lifshitz tails. In the case of asymmetric matrices,…

Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…

Random matrices formed from i.i.d. standard real Gaussian entries have the feature that the expected number of real eigenvalues is non-zero. This property persists for products of such matrices, independently chosen, and moreover it is…

We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…