Eigenvalue Outliers of non-Hermitian Random Matrices with a Local Tree Structure

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.

arXiv comment25 pages, 4 figures

References in corpus (29)

• The Bethe lattice spin glass revisited
• Spectral redemption: clustering sparse networks
• Non-Hermitean Random Matrix Theory: method of hermitization
• Around the circular law
• Google matrix analysis of directed networks
• Almost-Hermitian Random Matrices: Eigenvalue Density in the Complex Plane
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Transition to chaos in random networks with cell-type-specific connectivity
• Non-Gaussian Non-Hermitean Random Matrix Theory: phase transitions and addition formalism
• Non-Hermitian Localization in Biological Networks
• Nonlinear Analogue of the May-Wigner Instability Transition
• Nonhermitean Random Matrix Models
• Cavity approach to the spectral density of non-Hermitian sparse matrices
• On the localization transition in symmetric random matrices
• Anderson model on Bethe lattices: density of states, localization properties and isolated eigenvalue
• The Cavity Approach to Parallel Dynamics of Ising Spins on a Graph
• Spectra of sparse non-Hermitian random matrices: an analytical solution
• Spectra of sparse regular graphs with loops
• Eigenvalue method to compute the largest relaxation time of disordered systems
• Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices
• On random symmetric matrices with a constraint: the spectral density of random impedance networks
• 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
• Spectral Theory as Influenced by Fritz Gesztesy
• Fat-tailed distribution derived from first eigenvector of symmetric random sparse matrix

Cited by in corpus (26)

• Dynamics of random recurrent networks with correlated low-rank structure
• May's Instability in Large Economies
• Spectral Theory of Sparse Non-Hermitian Random Matrices
• On statistics of bi-orthogonal eigenvectors in real and complex Ginibre ensembles: combining partial Schur decomposition with supersymmetry
• Cavity and replica methods for the spectral density of sparse symmetric random matrices
• How does bond percolation happen in coloured networks?
• Linear stability analysis for large dynamical systems on directed random graphs
• Condition numbers for real eigenvalues in the real Elliptic Gaussian ensemble
• Localization and universality of eigenvectors in 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
• Algorithmic detectability threshold of the stochastic block model
• Instabilities of complex fluids with partially structured and partially random interactions
• Large deviation theory for diluted Wishart random matrices
• Dynamical Mean-Field Theory of Complex Systems on Sparse Directed Networks
• Top Eigenpair Statistics for Weighted Sparse Graphs
• Second largest Eigenpair Statistics for Sparse Graphs
• Antagonistic interactions can stabilise fixed points in heterogeneous linear dynamical systems
• Localization transition in non-Hermitian systems depending on reciprocity and hopping asymmetry
• Prevalence of multistability and nonstationarity in driven chemical networks
• Local sign stability and its implications for spectra of sparse random graphs and stability of ecosystems
• Epidemic threshold and localization of the SIS model on directed complex networks
• Eigenvalue spectral tails and localization properties of asymmetric networks
• Phase transitions in atypical systems induced by a condensation transition on graphs
• Top eigenpair statistics of diluted Wishart matrices
• Contribution of directedness in graph spectra