For each $n$, let $U_n$ be Haar distributed on the group of $n\times n$ unitary matrices. Let $\bfx_{n,1},\ldots,\bfx_{n,m} $ denote orthogonal nonrandom unit vectors in ${\Bbb C}^n$ and let $\text{\bf u}_{n,k}=(u_k^1,\ldots,u_k^n)^*=U^*\text{\bf x}_{n,k}$, $k=1,\ldots,m$. Define the following functions on [0,1]: $X^{k,k}_n(t)=\sqrt n\sum_{i=1}^{[nt]}(|u_k^i|^2-\tfrac1n)$, $X_n^{k,k'}(t)=\sqrt{2n}\sum_{i=1}^{[nt]}\bar u_k^iu_{k'}^i$, $k<k'$. %("$\bar{\,\,\,\,\,}$" denoting conjugate). Then it is proven that $X_n^{k,k},\Re X_n^{k,k'}$, $\Im X_n^{k,k'}$, considered as random processes in $D[0,1]$, converge weakly, as $n\to\infty$, to $m^2$ independent copies of Brownian bridge.
The same result holds for the $m(m+1)/2$ processes in the real case, where $O_n$ is real orthogonal Haar distributed and $\bfx_{n,i}\in{\Bbb R}^n$, with $\sqrt n$ in $X^{k,k}_n$ and $\sqrt{2n}$ in $X_n^{k,k'}$ replaced with $\sqrt{\frac n2}$ and $\sqrt{n}$, respectively. This latter result will be shown to hold for the matrix of eigenvectors of $M_n=(1/s)V_nV_n^T$ where $V_n$ is $n\times s$ consisting of the entries of $\{v_{ij}\},\ i,j=1,2,\ldots$, i.i.d. standardized and symmetrically distributed, with each $\bfx_{n,i}=\{\pm1/\sqrt n,\ldots,\pm1/\sqrt n\}$, and $n/s\to y>0$ as $n\to\infty$. This result extends the result in J.W. Silverstein {\sl Ann. Probab. \bf18} 1174-1194.
These results are applied to the detection problem in sampling random vectors mostly made of noise and detecting whether the sample includes a nonrandom vector.
When some eigenvalues of a spiked multiplicative resp. additive deformation model of a Hermitian Wigner matrix resp. a sample covariance matrix separate from the bulk, we study how the corresponding eigenvectors project onto those of the perturbation. We point out that the inverse of the subordination function relative to the free additive resp. multiplicative convolution plays an important part in the asymptotic behavior.
We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erdős-Rényi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the graphs. Our methodology follows [6] by analyzing the eigenvector flow under Dyson Brownian motion, combining with an isotropic local law for Green's function. As an auxiliary result, we prove that for the eigenvector flow of Dyson Brownian motion with general initial data, the eigenvectors are asymptotically jointly normal in the direction $q$ after time $η_*\ll t…
We prove that an n by n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n^{-1/2}), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach to delocalization for random matrices.
Consider an n x n Hermitian random matrix with, above the diagonal, independent entries with alpha-stable symmetric distribution and 0 < alpha < 2. We establish new bounds on the rate of convergence of the empirical spectral distribution of this random matrix as n goes to infinity. When 1 < alpha < 2 we give vanishing bounds on the Lp-norm of the eigenvectors normalized to have unit L2-norm goes to 0. On the contrary, when 0 < alpha < 2/3, we prove that these eigenvectors are localized.
Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any subset of its coordinates carries an appropriate proportion of its mass. Our results hold for random matrices with genuinely complex as well as real entries. In both cases, our bounds match numerical simulations, up to lower order terms, indicating the optimality of our results. As an application of our methods, we also establish delocalization bounds for normal…
Pickrell has fully characterized the unitarily invariant probability measures on infinite Hermitian matrices, and an alternative proof of this classification has been found by Olshanski and Vershik. Borodin and Olshanski deduced from this proof that under any of these invariant measures, the extreme eigenvalues of the minors, divided by the dimension, converge almost surely. In this paper, we prove that one also has a weak convergence for the eigenvectors, in a sense which is made precise. After mapping Hermitian to unitary matrices via the Cayley transform, our result extends a convergence pr…
We consider an Information-Plus-Noise type matrix where the Information matrix is a spiked matrix. When some eigenvalues of the random matrix separate from the bulk, we study how the corresponding eigenvectors project onto those of the spikes. Note that, in an Appendix, we present alternative versions of the earlier results of Bai and Silverstein about the lack of eigenvalues outside the support of the deterministic equivalent measure and of Capitaine about the exact separation phenomenon, where we remove some technical assumptions.
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 $\mathbf{v},\mathbf{v}'$ associated with distinct eigenvalues $λ,λ'$ that are the closest to specified points $z,z'$ in the complex plane, the rescaled inner product $$\sqrt{n}(λ'-λ)\langle\mathbf{v},\mathbf{v}'\rangle$$ is uniformly sub-Gaussian, and give a more precise statement in the case of the Ginibre ensemble.
In this paper, we investigate the fluctuations of a unit eigenvector associated to an outlier in the spectrum of a spiked $N\times N$ complex Deformed Wigner matrix $M_N$: $M_N =W_N/\sqrt{N} + A_N$ where $W_N$ is an $N \times N$ Hermitian Wigner matrix whose entries have a law $μ$ satisfying a Poincaré inequality and the matrix $A_N$ is a block diagonal matrix, with an eigenvalue $θ$ of multiplicity one, generating an outlier in the spectrum of $M_N$. We prove that the fluctuations of the norm of the projection of a unit eigenvector corresponding to the outlier of $M_N$ onto a unit eigenvector…
We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $α$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by $U=[u_{ij}]$ the eigenvectors matrix (corresponding to increasing eigenvalues) and prove that the bivariate process $$B^n_{s,t}:=n^{-1/2}\sum_{1\le i\le ns, 1\le j\le nt}(|u_{ij}|^2 -n^{-1}),$$ indexed by $s,t\in [0,1]$, converges in law to a non trivial Gaussian process. An interesting part of this result is the $n^{-1/2}$ rescaling, proving that from this point of view, …
We consider eigenvectors of adjacency matrices of Erdős-Rényi graphs and study the variation of their directions by resampling the entries randomly. Let $\mathbf{v}$ be the eigenvector associated with the second-largest eigenvalue of the Erdős-Rényi graphs. After choosing $k$ entries of the given matrix randomly and resampling them, we obtain another eigenvector $\mathbf{w}$ corresponding to the second-largest eigenvalue of the matrix obtained from the resampling procedure. We prove that, in a certain sparsity regime, $\mathbf{w}$ is "almost" orthogonal to $\mathbf{v}$ with high probability if…
Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is random.
The four moment theorem asserts, roughly speaking, that the joint distribution of a small number of eigenvalues of a Wigner random matrix (when measured at the scale of the mean eigenvalue spacing) depends only on the first four moments of the entries of the matrix. In this paper, we extend the four moment theorem to also cover the coefficients of the \emph{eigenvectors} of a Wigner random matrix. A similar result (with different hypotheses) has been proved recently by Knowles and Yin, using a different method. As an application, we prove some central limit theorems for these eigenvectors. In …
We study joint eigenvector distributions for large symmetric matrices in the presence of weak noise. Our main result asserts that every submatrix in the orthogonal matrix of eigenvectors converges to a multidimensional Gaussian distribution. The proof involves analyzing the stochastic eigenstate equation (SEE) which describes the Lie group valued flow of eigenvectors induced by matrix valued Brownian motion. We consider the associated colored eigenvector moment flow defining an SDE on a particle configuration space. This flow extends the eigenvector moment flow first introduced in Bourgade and…
Let $M_n$ be an $n\times n$ real (resp. complex) Wigner matrix and $U_nΛ_n U_n^*$ be its spectral decomposition. Set $(y_1,y_2...,y_n)^T=U_n^*x$, where $x=(x_1,x_2,...,$ $x_n)^T$ is a real (resp. complex) unit vector. Under the assumption that the elements of $M_n$ have 4 matching moments with those of GOE (resp. GUE), we show that the process $X_n(t)=\sqrt{\frac{βn}{2}}\sum_{i=1}^{\lfloor nt\rfloor}(|y_i|^2-\frac1n)$ converges weakly to the Brownian bridge for any $\mathbf{x}$ such that $||x||_\infty\rightarrow 0$ as $n\rightarrow \infty$, where $β=1$ for the real case and $β=2$ for the compl…
In this paper, we prove a universality result of convergence for a bivariate random process defined by the eigenvectors of a sample covariance matrix. Let $V_n=(v_{ij})_{i \leq n,\, j\leq m}$ be a $n\times m$ random matrix, where $(n/m)\to y > 0$ as $ n \to \infty$, and let $X_n=(1/m) V_n V^{*}_n $ be the sample covariance matrix associated to $V_n \:$. Consider the spectral decomposition of $X_n$ given by $ U_n D_n U_n^{*}$, where $U_n=(u_{ij})_{n\times n}$ is an eigenmatrix of $X_n$. We prove, under some moments conditions, that the bivariate random process $<B_{s,t}^{n} = \underset{1\leq j …
We study two spiked models of random matrices under general frameworks corresponding respectively to additive deformation of random symmetric matrices and multiplicative perturbation of random covariance matrices. In both cases, the limiting spectral measure in the direction of an eigenvector of the perturbation leads to old and new results on the coordinates of eigenvectors.
Let $x \in S^{n-1}$ be a unit eigenvector of an $n \times n$ random matrix. This vector is delocalized if it is distributed roughly uniformly over the real or complex sphere. This intuitive notion can be quantified in various ways. In these lectures, we will concentrate on the no-gaps delocalization. This type of delocalization means that with high probability, any non-negligible subset of the support of $x$ carries a non-negligible mass. Proving the no-gaps delocalization requires establishing small ball probability bounds for the projections of random vector. Using Fourier transform, we will…
The eigenvector empirical spectral distribution (VESD) is a useful tool in studying the limiting behavior of eigenvalues and eigenvectors of covariance matrices. In this paper, we study the convergence rate of the VESD of sample covariance matrices to the deformed Marčenko-Pastur (MP) distribution. Consider sample covariance matrices of the form $Σ^{1/2} X X^* Σ^{1/2}$, where $X=(x_{ij})$ is an $M\times N$ random matrix whose entries are independent random variables with mean zero and variance $N^{-1}$, and $Σ$ is a deterministic positive-definite matrix. We prove that the Kolmogorov distance …
We consider the eigenvalues and eigenvectors of small rank perturbations of random $N\times N$ matrices. We allow the rank of perturbation $M$ increases with $N$, and the only assumption is $M=o(N)$. In both additive and multiplicative perturbation models, we prove rigidity results for the outliers of the perturbed random matrices. Based on the rigidity results we derive the empirical distribution of outliers of the perturbed random matrices. We also compute the appropriate projection of eigenvectors corresponding to the outliers of the perturbed random matrices, which are approximate eigenvec…
We propose a boundary regularity condition for the $M_n(\mathbb{C})$-valued subordination functions in free probability to prove the local limit theorem and delocalization of eigenvectors for polynomials in two random matrices. We prove this through estimating the pair of $M_n(\mathbb{C})$-valued approximate subordination functions for the sum of two $M_n(\mathbb{C})$-valued random matrices $γ_1\otimes C_N+γ_2\otimes U_N^*D_NU_N$, where $C_N$, $D_N$ are deterministic diagonal matrices, and $U_N$ is Haar unitary.
We analyze statistics for eigenvector entries of heavy-tailed random symmetric matrices (also called Lévy matrices) whose associated eigenvalues are sufficiently small. We show that the limiting law of any such entry is non-Gaussian, given by the product of a normal distribution with another random variable that depends on the location of the corresponding eigenvalue. Although the latter random variable is typically non-explicit, for the median eigenvector it is given by the inverse of a one-sided stable law. Moreover, we show that different entries of the same eigenvector are asymptotically i…
We prove that any finite collection of quadratic forms (overlaps) of general deterministic matrices and eigenvectors of an $N\times N$ Wigner matrix has joint Gaussian fluctuations. This can be viewed as the random matrix analogue of the Berry random wave conjecture.
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 the perturbed matrix for additive and multiplicative perturbation models. The limiting non-random value is shown to depend explicitly on the limiting eigenvalue distribution of the unperturbed random matrix and the assumed perturbation model via integral transforms that correspond to very well known objects in free probability theory that linearize non-commuta…
We consider random matrices of the form $H = W + λV$, $λ\in\mathbb{R}^+$, where $W$ is a real symmetric or complex Hermitian Wigner matrix of size $N$ and $V$ is a real bounded diagonal random matrix of size $N$ with i.i.d.\ entries that are independent of $W$. We assume subexponential decay for the matrix entries of $W$ and we choose $λ\sim 1$, so that the eigenvalues of $W$ and $λV$ are typically of the same order. Further, we assume that the density of the entries of $V$ is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is $λ_+\…
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 ball probability bound for linear combinations of the coordinates of $\mathbf{v}$. Our results generalize the works of Meehan and Nguyen as well as Touri and the second author for random symmetric matrices. Along the way, we provide an optimal estimate of the probability that an iid matrix has simple spectrum, improving a recent result of Ge. Our techniques als…
We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at least $1-e^{-\log^{2} n}$ $$ \min\limits_{I\subset[n],\,|I|= m}\|{\bf v}_I\| \geq \frac{m^{3/2}}{n^{3/2}\log^Cn}\|{\bf v}\| $$ for any real eigenvector ${\bf v}$ and any $m\in[\log^C n,n]$, where ${\bf v}_I$ denotes the restriction of ${\bf v}$ to $I$. Further, when the entries of $A$ are complex, with i.i.d real and imaginary parts, we show that with probabili…
We prove a local law and eigenvector delocalization for general Wigner-type matrices. Our methods allow us to get the best possible interval length and optimal eigenvector delocalization in the dense case, and the first results of such kind for the sparse case down to $p=\frac{g(n)\log n}{n}$ with $g(n)\to\infty$. We specialize our results to the case of the Stochastic Block Model, and we also obtain a local law for the case when the number of classes is unbounded.
We analyze the distribution of eigenvectors for mesoscopic, mean-field perturbations of diagonal matrices in the bulk of the spectrum. Our results apply to a generalized $N\times N$ Rosenzweig-Porter model. We prove that the eigenvectors entries are asymptotically Gaussian with a specific variance, localizing them onto a small, explicit part of the spectrum. For a well spread initial spectrum, this variance profile universally follows a heavy-tailed Cauchy distribution. In the case of smooth entries, we also obtain a strong form of quantum unique ergodicity as an overwhelming probability bound…
In this text, we consider an N by N random matrix X such that all but o(N) rows of X have W non identically zero entries, the other rows having lass than $W$ entries (such as, for example, standard or cyclic band matrices). We always suppose that 1 << W << N. We first prove that if the entries are independent, centered, have variance one, satisfy a certain tail upper-bound condition and W >> (\log N)^{6(1+α)}, where αis a positive parameter depending on the distribution of the entries, then the largest eigenvalue of X/\sqrt{W} converges to the upper bound of its limit spectral distribution, th…
In this paper, we study the eigenvalues and eigenvectors of the spiked invariant multiplicative models when the randomness is from Haar matrices. We establish the limits of the outlier eigenvalues $\widehatλ_i$ and the generalized components ($\langle \mathbf{v}, \widehat{\mathbf{u}}_i \rangle$ for any deterministic vector $\mathbb{v}$) of the outlier eigenvectors $\widehat{\mathbf{u}}_i$ with optimal convergence rates. Moreover, we prove that the non-outlier eigenvalues stick with those of the unspiked matrices and the non-outlier eigenvectors are delocalized. The results also hold near the s…
We study random, symmetric $N \times N$ band matrices with a band of size $W$ and Bernoulli random variables as entries. This interpolates between nearest neighbour interaction $W = 1$ and Wigner matrices $W = N$. Eigenvectors are known to be localized for $W \ll N^{1/8}$, delocalized for $W \gg N^{4/5}$ and it is conjectured that the transition for the bulk occurs at $W \sim N^{1/2}$. Eigenvalues in the spectral edge change their behavior at $W \sim N^{5/6}$ but nothing is known about the associated eigenvectors. We show that up to $W \ll N^{5/7}$ any random matrix has with large probability …
We investigate the noise sensitivity of the top eigenvector of a sparse random symmetric matrix. Let $v$ be the top eigenvector of an $N\times N$ sparse random symmetric matrix with an average of $d$ non-zero centered entries per row. We resample $k$ randomly chosen entries of the matrix and obtain another realization of the random matrix with top eigenvector $v^{[k]}$. Building on recent results on sparse random matrices and a noise sensitivity analysis previously developed for Wigner matrices, we prove that, if $d\geq N^{2/9}$, with high probability, when $k \ll N^{5/3}$, the vectors $v$ and…
We consider $N\times N$ Hermitian or symmetric random matrices with independent entries. The distribution of the $(i,j)$-th matrix element is given by a probability measure $ν_{ij}$ whose first two moments coincide with those of the corresponding Gaussian ensemble. We prove that the joint probability distribution of the components of eigenvectors associated with eigenvalues close to the spectral edge agrees with that of the corresponding Gaussian ensemble. For eigenvectors associated with bulk eigenvalues, the same conclusion holds provided the first four moments of the distribution $ν_{ij}$ c…
Let $U_n=[u_{i,j}]$ be the eigenvectors matrix of a Wigner matrix. We prove that under some moments conditions, the bivariate random process indexed by $[0,1]^2$ with value at $(s,t)$ equal to the sum, over $1\le i \le ns$ and $1\le j \le nt$, of $|u_{i,j}|^2 - 1/n$, converges in distribution to the bivariate Brownian bridge. This result has already been proved for GOE and GUE matrices. It is conjectured here that the necessary and sufficient condition, for the result to be true for a general Wigner matrix, is the matching of the moments of orders 1, 2 and 4 of the entries of the Wigner with t…
We investigate eigenvector statistics of the Truncated Unitary ensemble $\mathrm{TUE}(N,M)$ in the weakly non-unitary case $M=1$, that is when only one row and column are removed. We provide an explicit description of generalized overlaps as deterministic functions of the eigenvalues, as well as a method to derive an exact formula for the expectation of diagonal overlaps (or squared eigenvalue condition numbers), conditionally on one eigenvalue. This complements recent results obtained in the opposite regime when $M \geq N$, suggesting possible extensions to $\mathrm{TUE}(N,M)$ for all values …
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 constants. Our proof uses an analysis of the eigenvector moment flow introduced by Bourgade and Yau (2017) to bound logarithmic moments of eigenvector entries for random matrices with small Gaussian components. We then extend this control to all generalized Wigner matrices by comparison arguments based on a framework of regularized eigenvectors, level repulsion, and …
We consider matrices formed by a random $N\times N$ matrix drawn from the Gaussian Orthogonal Ensemble (or Gaussian Unitary Ensemble) plus a rank-one perturbation of strength $θ$, and focus on the largest eigenvalue, $x$, and the component, $u$, of the corresponding eigenvector in the direction associated to the rank-one perturbation. We obtain the large deviation principle governing the atypical joint fluctuations of $x$ and $u$. Interestingly, for $θ>1$, in large deviations characterized by a small value of $u$, i.e. $u<1-1/θ$, the second-largest eigenvalue pops out from the Wigner semi-circ…
Recovering low-rank structures via eigenvector perturbation analysis is a common problem in statistical machine learning, such as in factor analysis, community detection, ranking, matrix completion, among others. While a large variety of bounds are available for average errors between empirical and population statistics of eigenvectors, few results are tight for entrywise analyses, which are critical for a number of problems such as community detection. This paper investigates entrywise behaviors of eigenvectors for a large class of random matrices whose expectations are low-rank, which helps …
