Related papers: Eigenvector decorrelation for random matrices

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…

Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with…

In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…

Wigner gave a well-known proof of Kramers degeneracy, for time reversal invariant systems containing an odd number of half-integer spin particles. But Wigner's proof relies on the assumption that the Hamiltonian has an eigenvector, and thus…

We consider $N\times N$ Hermitian random matrices with independent identically distributed entries (Wigner matrices). The matrices are normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. Under suitable…

We study the asymptotic behavior of the principal eigenvector and eigenvalue of the random conductance Laplacian in a large domain of $\mathbb{Z}^d$ ($d\geq 2$) with zero Dirichlet condition. We assume that the conductances $w$ are positive…

For piecewise expanding one-dimensional maps without periodic turning points we prove that isolated eigenvalues of small (random) perturbations of these maps are close to isolated eigenvalues of the unperturbed system. (Here ``eigenvalue''…

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…

Rayleigh-Schr\"{o}dinger perturbation theory is a well-known theory in quantum mechanics and it offers useful characterization of eigenvectors of a perturbed matrix. Suppose $A$ and perturbation $E$ are both Hermitian matrices, $A^t = A +…

We study the eigenvalue correlations of random Hermitian $n\times n$ matrices of the form $S=M+\epsilon H$, where $H$ is a GUE matrix, $\epsilon>0$, and $M$ is a positive-definite Hermitian random matrix, independent of $H$, whose…

The remarkable universality of the eigenvalue correlation functions is perhaps one of the most salient findings in random matrix theory. Particularly for short-range separations of the eigenvalues, the correlation functions have been shown…

Let $d$ and $n$ be integers satisfying $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in \mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this…

We develop deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors, in a spirit similar to classical results for matrices such as those due to Weyl, Davis, Kahan and Wedin. Our bounds…

We prove that the distribution of eigenvectors of generalized Wigner matrices is universal both in the bulk and at the edge. This includes a probabilistic version of local quantum unique ergodicity and asymptotic normality of the…

Two-point correlators and self-correlators of primordial perturbations in quasi-de Sitter spacetime backgrounds are considered. For large separations two-point correlators exhibit nearly scale invariance, while for short distances…

By using the method of orthogonal polynomials we analyze the statistical properties of complex eigenvalues of random matrices describing a crossover from Hermitian matrices characterized by the Wigner- Dyson statistics of real eigenvalues…

We are concerned with the eigenstructure of supersymmetric tensors. Like in the matrix case, normalized tensor eigenvectors are fixed points of the tensor power iteration map. However, unless the given tensor is orthogonally decomposable,…

We previously showed that the real eigenvalues of 3x3 octonionic Hermitian matrices form two separate families, each containing 3 eigenvalues, and each leading to an orthonormal decomposition of the identity matrix, which would normally…

This paper asks if the following iterative procedure approximately orthogonalizes a set of $n$ linearly independent unit vectors while preserving their span: in each iteration, access a random pair of vectors and replace one with the…

Complex networks with directed, local interactions are ubiquitous in nature, and often occur with probabilistic connections due to both intrinsic stochasticity and disordered environments. Sparse non-Hermitian random matrices arise…