{"product_id":"graph-spectra-for-complex-networks-paperback-softback-9781009366809","title":"Graph Spectra for Complex Networks (Paperback \/ softback) 9781009366809","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eGraph Spectra for Complex Networks\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eSpectral properties of the adjacency, Laplacian and effective resistance matrices of graphs are derived and applied to complex networks.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003ePiet Van Mieghem (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781009366809, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback \/ softback, published 21 September 2023\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e536 pages\u003cbr\u003e24.2 x 17 x 3.1 cm, 0.92 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'This book provides a comprehensive background in the area, especially for researchers and graduate students … Highly recommended.' J. T. Saccoman, CHOICE\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSymbols\u003cbr\u003e 1. Introduction\u003cbr\u003e Part I. Spectra of Graphs: 2. Algebraic graph theory\u003cbr\u003e 3. Eigenvalues of the adjacency matrix\u003cbr\u003e 4. Eigenvalues of the Laplacian Q\u003cbr\u003e 5. Effective resistance matrix\u003cbr\u003e 6. Spectra of special types of graphs\u003cbr\u003e 7. Density function of the eigenvalues\u003cbr\u003e 8. Spectra of complex networks\u003cbr\u003e Part II. Eigensystem: 9. Topics in linear algebra\u003cbr\u003e 10. Eigensystem of a matrix\u003cbr\u003e Part III. Polynomials: 11. Polynomials with real coefficients\u003cbr\u003e 12. Orthogonal polynomials\u003cbr\u003e References\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Algorithms \u0026amp; data structures [\u003ca title=\"See our other books on Algorithms \u0026amp; data structures\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algorithms%20\u0026amp;%20data%20structures%20%5BUMB%5D%22\"\u003eUMB\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Brand New","offer_id":52458454548760,"sku":"9781009366809","price":43.29,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781009366809i.jpg?v=1785373420","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/graph-spectra-for-complex-networks-paperback-softback-9781009366809","provider":"Freshly Printed Books","version":"1.0","type":"link"}