Graph Spectra for Complex Networks

A concise and self-contained 2010 introduction to the theory of graph spectra and its applications to the study of complex networks.

Piet van Mieghem (Author)

9780521194587, Cambridge University Press

Hardback, published 2 December 2010

364 pages
24.4 x 17.3 x 2.5 cm, 0.78 kg

Analyzing the behavior of complex networks is an important element in the design of new man-made structures such as communication systems and biologically engineered molecules. Because any complex network can be represented by a graph, and therefore in turn by a matrix, graph theory has become a powerful tool in the investigation of network performance. This self-contained 2010 book provides a concise introduction to the theory of graph spectra and its applications to the study of complex networks. Covering a range of types of graphs and topics important to the analysis of complex systems, this guide provides the mathematical foundation needed to understand and apply spectral insight to real-world systems. In particular, the general properties of both the adjacency and Laplacian spectrum of graphs are derived and applied to complex networks. An ideal resource for researchers and students in communications networking as well as in physics and mathematics.

Preface
Acknowledgements
1. Introduction
Part I. Spectra of Graphs: 2. Algebraic graph theory
3. Eigenvalues of the adjacency matrix
4. Eigenvalues of the Laplacian Q
5. Spectra of special types of graphs
6. Density function of the eigenvalues
7. Spectra of complex networks
Part II. Eigensystem and Polynomials: 8. Eigensystem of a matrix
9. Polynomials with real coefficients
10. Orthogonal polynomials
List of symbols
Bibliography
Index.

Subject Areas: Signal processing [UYS], Communications engineering / telecommunications [TJK], Applied mathematics [PBW]