Spectral density of random graphs with topological constraints

DOI10.1088/1751-8113/43/19/195002MaRDI QIDQ3563989zbMATH OpenOpenAlexFDO

Authors Tim Rogers, Conrad Pérez Vicente, Koujin Takeda, Isaac Pérez Castillo

Publication date 2 June 2010

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0910.3556

zbMATH Keywords

dynamic lattice systems (kinetic Ising) and systems on graphsimbeddinginteracting random processespercolation theoryrandom graphsrandom matricesreplica methodstatistical mechanics type modelstopological graph theory

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

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.

Recommendations

• Spectra of sparse random matrices
• Imaginary replica analysis of loopy regular random graphs
• An approximation scheme for the density of states of the Laplacian on random graphs
• scientific article; zbMATH DE number 5004834
• Spectral density of complex networks with a finite mean degree

Cited in

(14)

• Spectral density of equitable core-periphery graphs
• A spectral signature of breaking of ensemble equivalence for constrained random graphs
• Spectral density of complex networks with a finite mean degree
• An approximation scheme for the density of states of the Laplacian on random graphs
• Spectral density of random graphs: convergence properties and application in model fitting
• Spectral bounds in random graphs applied to spreading phenomena and percolation
• Imaginary replica analysis of loopy regular random graphs
• Spectral theory of sparse non-Hermitian random matrices
• Top eigenpair statistics for weighted sparse graphs
• Second largest eigenpair statistics for sparse graphs
• Eigenvalue spectral tails and localisation properties of asymmetric networks
• Top eigenpair statistics of diluted Wishart matrices
• Sequential stub matching for asymptotically uniform generation of directed graphs with a given degree sequence
• Statistical field theory of random graphs with prescribed degrees

This page was built for publication: Spectral density of random graphs with topological constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563989)