Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Graph Spectra for Complex Networks, Paperback / softback Book

Graph Spectra for Complex Networks Paperback / softback

Paperback / softback

Description

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.

Information

Save 7%

£49.99

£46.35

 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information