Spectral density of random graphs with topological constraints

Abstract

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case an exact solution is found for the spectral density in the form of consistency equations depending on the statistical properties of the graph ensemble in question. We highlight the effect of these topological constraints on the resulting spectral density.

24 pages, 6 figures

References in corpus (9)

• Community detection in graphs
• Critical phenomena in complex networks
• Loop series for discrete statistical models on graphs
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Spectra of Sparse Random Matrices
• Entropies of complex networks with hierarchically constrained topologies
• Cavity approach to the spectral density of non-Hermitian sparse matrices
• Spin models on random graphs with controlled topologies beyond degree constraints
• Spectral Density of Complex Networks with a Finite Mean Degree

Cited by in corpus (21)

• Cavity and replica methods for the spectral density of sparse symmetric random matrices
• Spectra of networks containing short loops
• Spectra of random networks with arbitrary degrees
• Finite size correction to the spectrum of regular random graphs: an analytical solution
• Spectra of random graphs with community structure and arbitrary degrees
• Large deviation function for the number of eigenvalues of sparse random graphs inside an interval
• Spectra of Modular and Small-World Matrices
• Linear stability analysis for large dynamical systems on directed random graphs
• Universal hypotrochoidic law for random matrices with cyclic correlations
• 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
• Large deviation theory for diluted Wishart random matrices
• Second largest Eigenpair Statistics for Sparse Graphs
• Calculation of mean spectral density for statistically uniform tree-like random models
• Null-eigenvalue localization of quantum walks on real-world complex networks
• Effects of clustering heterogeneity on the spectral density of sparse networks
• Theory for the conditioned spectral density of non-invariant random matrices
• Eigenvalue spectral tails and localization properties of asymmetric networks
• Branching random graph model of rough surfaces describes thermal properties of the effective molecular potential
• Statistical field theory of random graphs with prescribed degrees
• Top eigenpair statistics of diluted Wishart matrices