Spectral density of random graphs with topological constraints

DOI10.1088/1751-8113/43/19/195002zbMath1209.05229arXiv0910.3556OpenAlexW3102816311MaRDI QIDQ3563989

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

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

random matricesreplica methodrandom graphsinteracting random processespercolation theoryimbeddingstatistical mechanics type modelstopological graph theorydynamic lattice systems (kinetic Ising) and systems on graphs

Mathematics Subject Classification ID

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

Related Items (3)

Spectral theory of sparse non-Hermitian random matrices ⋮ Top eigenpair statistics for weighted sparse graphs ⋮ Second largest eigenpair statistics for sparse graphs

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