Eigenvalue Outliers of non-Hermitian Random Matrices with a Local Tree Structure
arXiv:1611.07993 · doi:10.1103/PhysRevLett.117.224101
Abstract
Spectra of sparse non-Hermitian random matrices determine the dynamics of complex processes on graphs. Eigenvalue outliers in the spectrum are of particular interest, since they determine the stationary state and the stability of dynamical processes. We present a general and exact theory for the eigenvalue outliers of random matrices with a local tree structure. For adjacency and Laplacian matrices of oriented random graphs, we derive analytical expressions for the eigenvalue outliers, the first moments of the distribution of eigenvector elements associated with an outlier, the support of the spectral density, and the spectral gap. We show that these spectral observables obey universal expressions, which hold for a broad class of oriented random matrices.
25 pages, 4 figures
References in corpus (10)
- Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
- Transition to chaos in random networks with cell-type-specific connectivity
- Cavity approach to the spectral density of non-Hermitian sparse matrices
- On the localization transition in symmetric random matrices
- First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
- Limitations in the spectral method for graph partitioning: detectability threshold and localization of eigenvectors
- Eigenvalue Separation in Some Random Matrix Models
- Gaussian Belief Propagation: Theory and Aplication
- Spectra of Random Stochastic Matrices and Relaxation in Complex Systems
- Spectral density of the non-backtracking operator