Spectra of Modular and Small-World Matrices

Abstract

We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate spectra of a certain class of small-world matrices generated from random graphs by introducing short-cuts via additional random connectivity components. Both adjacency matrices and the associated graph Laplacians are investigated. For the Laplacians, we find Lifshitz type singular behaviour of the spectral density in a localised region of small $|\lambda |$ values. In the case of modular networks, we can identify contributions local densities of state from individual modules. For small-world networks, we find that the introduction of short cuts can lead to the creation of satellite bands outside the central band of extended states, exhibiting only localised states in the band-gaps. Results for the ensemble in the thermodynamic limit are in excellent agreement with those obtained via a cavity approach for large finite single instances, and with direct diagonalisation results.

18 pages, 5 figures

References in corpus (8)

• Modularity and community structure in networks
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Spectra of Sparse Random Matrices
• Spectral and Dynamical Properties in Classes of Sparse Networks with Mesoscopic Inhomogeneities
• On the localization transition in symmetric random matrices
• Spectral density of random graphs with topological constraints
• Spectral Density of Complex Networks with a Finite Mean Degree
• Spectral densities of scale-free networks

Cited by in corpus (25)

• Eigenvalue Spectra of Modular Networks
• Collective Relaxation Dynamics of Small-World Networks
• Cavity and replica methods for the spectral density of sparse symmetric random matrices
• Finite size correction to the spectrum of regular random graphs: an analytical solution
• Spectra of random graphs with community structure and arbitrary degrees
• Universality in the spectral and eigenfunction properties of random networks
• Small-world spectra in mean field theory
• Large deviation function for the number of eigenvalues of sparse random graphs inside an interval
• Spectra of sparse regular graphs with loops
• Localization of eigenvectors in random graphs
• First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
• A unifying model for random matrix theory in arbitrary space dimensions
• A generative model for protein contact networks
• The spectral density of dense random networks and the breakdown of the Wigner semicircle law
• Analytic solution of the resolvent equations for heterogeneous random graphs: spectral and localization properties
• Scattering and transport properties of tight-binding random networks
• Top Eigenpair Statistics for Weighted Sparse Graphs
• Second largest Eigenpair Statistics for Sparse Graphs
• Localization in random bipartite graphs: numerical and empirical study
• Null-eigenvalue localization of quantum walks on real-world complex networks
• Effects of clustering heterogeneity on the spectral density of sparse networks
• Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory
• Replica theory for learning curves for Gaussian processes on random graphs
• Spectral Density of Complex Networks with Two Species of Nodes
• Spectral density of equitable core-periphery graphs