Spectra of modular random graphs
From MaRDI portal
Publication:3650409
Abstract: We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete. Two different types of inter-module connectivity are considered, one where the number of intermodule connections per-node diverges, and one where this number remains finite in the infinite module-size limit. In the first case, results can be understood as a perturbation of a superposition of semicircular spectral densities one would obtain for uncoupled modules. In the second case, matters can be more involved, and depend in detail on inter-module connectivities. For suitable parameters we even find near-triangular shaped spectral densities, similar to those observed in certain scale-free networks, in a system of consisting of just two coupled modules. Analytic results are presented for the infinite module-size limit; they are well corroborated by numerical simulations.
Recommendations
Cited in
(8)- Top eigenpair statistics for weighted sparse graphs
- Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory
- Second largest eigenpair statistics for sparse graphs
- scientific article; zbMATH DE number 6902684 (Why is no real title available?)
- Spectra of modular and small-world matrices
- Singularities of solutions to quadratic vector equations on the complex upper half-plane
- Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices
- Spectral properties of unimodular lattice triangulations
This page was built for publication: Spectra of modular random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650409)