Graph Spectra for Complex Networks

This concise and self-contained introduction builds up the spectral theory of graphs from scratch with linear algebra and the theory of polynomials developed in the later parts. The book focuses on properties and bounds for the eigenvalues of the adjacency Laplacian and effective resistance matrices of a graph. The goal of the book is to collect spectral properties that may help to understand the behavior or main characteristics of real-world networks. The chapter on spectra of complex networks illustrates how the theory may be applied to deduce insights into real-world networks. The second edition contains new chapters on topics in linear algebra and on the effective resistance matrix and treats the pseudoinverse of the Laplacian. The latter two matrices and the Laplacian describe linear processes such as the flow of current on a graph. The concepts of spectral sparsification and graph neural networks are included.