Spectra of sparse non-Hermitian random matrices: an analytical solution
arXiv:1205.0702 · doi:10.1103/PhysRevLett.109.030602
Abstract
We present the exact analytical expression for the spectrum of a sparse non-Hermitian random matrix ensemble, generalizing two classical results in random-matrix theory: this analytical expression forms a non-Hermitian version of the Kesten-Mckay law as well as a sparse realization of Girko's elliptic law. Our exact result opens new perspectives in the study of several physical problems modelled on sparse random graphs. In this context, we show analytically that the convergence rate of a transport process on a very sparse graph depends upon the degree of symmetry of the edges in a non-monotonous way.
5 pages, 5 figures, 12 pages supplemental material
References in corpus (8)
- Around the circular law
- Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
- The totally asymmetric simple exclusion process on networks
- Cavity approach to the spectral density of non-Hermitian sparse matrices
- On the localization transition in symmetric random matrices
- Testing the Collective Properties of Small-World Networks through Roughness Scaling
- Spectra of sparse regular graphs with loops
- Enhancing synchronization by directionality in complex networks
Cited by in corpus (27)
- Non-Hermitian Localization in Biological Networks
- Dynamics of random recurrent networks with correlated low-rank structure
- Non-Hermitian Topological Phases: Principles and Prospects
- Spectral Theory of Sparse Non-Hermitian Random Matrices
- Cavity and replica methods for the spectral density of sparse symmetric random matrices
- Universality in the spectral and eigenfunction properties of random networks
- Eigenvalue Outliers of non-Hermitian Random Matrices with a Local Tree Structure
- Spacing ratio characterization of the spectra of directed random networks
- On the low dimensional dynamics of structured random networks
- Linear stability analysis for large dynamical systems on directed random graphs
- Universal transient behavior in large dynamical systems on networks
- Dynamical systems on large networks with predator-prey interactions are stable and exhibit oscillations
- Eigenvalue Repulsion and Eigenfunction Localization in Sparse Non-Hermitian Random Matrices
- Chebyshev-polynomial expansion of the localization length of Hermitian and non-Hermitian random chains
- Eigenvalue spectra and stability of directed complex networks
- The spectral density of dense random networks and the breakdown of the Wigner semicircle law
- Spectral density of the non-backtracking operator
- Extended Anderson Criticality in Heavy-Tailed Neural Networks
- Large deviation theory for diluted Wishart random matrices
- Top Eigenpair Statistics for Weighted Sparse Graphs
- Second largest Eigenpair Statistics for Sparse Graphs
- Localization transition in non-Hermitian systems depending on reciprocity and hopping asymmetry
- Real spectra of large real asymmetric random matrices
- Finite size effects. The averaged eigenvalue density of Wigner random sign real symmetric matrices
- Random Antagonistic Matrices
- A path integral approach to sparse non-Hermitian random matrices
- Top eigenpair statistics of diluted Wishart matrices