The Laplacian spectra of graphs and complex networks
From MaRDI portal
Publication:3170135
zbMATH Open1240.05187arXiv1111.2896MaRDI QIDQ3170135FDOQ3170135
Rong-Ying Pan, Ya-Hong Chen, Xiao-Dong Zhang
Publication date: 29 September 2011
Abstract: The paper is a brief survey of some recent new results and progress of the Laplacian spectra of graphs and complex networks (in particular, random graph and the small world network). The main contents contain the spectral radius of the graph Laplacian for given a degree sequence, the Laplacian coefficients, the algebraic connectivity and the graph doubly stochastic matrix, and the spectra of random graphs and the small world networks. In addition, some questions are proposed.
Full work available at URL: https://arxiv.org/abs/1111.2896
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cited In (8)
- The Laplacian Spectra of Small-World Networks
- Properties and applications of Laplacian spectra for Koch networks
- The spectrum of the averaging operator on a network (metric graph)
- Detection of hubs in complex networks by the Laplacian matrix
- Spectral plot properties: towards a qualitative classification of networks
- The spectrum of the graph Laplacian as a tool for analyzing structure and evolution of networks
- Graph Spectra for Complex Networks
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
This page was built for publication: The Laplacian spectra of graphs and complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170135)
