Emergence of a spectral gap in a class of random matrices associated with split graphs
From MaRDI portal
Publication:4606135
Abstract: Motivated by the intriguing behavior displayed in a dynamic network that models a population of extreme introverts and extroverts (XIE), we consider the spectral properties of ensembles of random split graph adjacency matrices. We discover that, in general, a gap emerges in the bulk spectrum between -1 and 0 that contains a single eigenvalue. An analytic expression for the bulk distribution is derived and verified with numerical analysis. We also examine their relation to chiral ensembles, which are associated with bipartite graphs.
Recommendations
- Splitting of a gap in the bulk of the spectrum of random matrices
- Spectral gaps of random graphs and applications
- The spectral gap of random regular graphs
- Spectral gap in random bipartite biregular graphs and applications
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- The Spectral Gap of a Random Subgraph of a Graph
- The spectral gap of a random subgraph of a graph
- Spectral gap of random hyperbolic graphs and related parameters
- The spectral gap of sparse random digraphs
- The Spectral Gap of Random Graphs with Given Expected Degrees
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3652386 (Why is no real title available?)
- scientific article; zbMATH DE number 3231028 (Why is no real title available?)
- Developments in random matrix theory
- Edge effects in some perturbations of the Gaussian unitary ensemble
- Eigenvalue separation in some random matrix models
- Graph spectra for complex networks
- Log-gases and random matrices.
- Modeling interacting dynamic networks. I: Preferred degree networks and their characteristics
- Networks with preferred degree: a mini-review and some new results
- On Wigner's semicircle law for the eigenvalues of random matrices
- Spectra of nearly Hermitian random matrices
- Split Graphs Having Dilworth Number Two
- Symmetry in complex networks
- The eigenvalues of random symmetric matrices
This page was built for publication: Emergence of a spectral gap in a class of random matrices associated with split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606135)