This page intentionally left blank
GRAPH SPECTRA FOR COMPLEX NETWORKS PIET VAN MIEGHEM Delft University of Technology...
21 downloads
1172 Views
3MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
This page intentionally left blank
GRAPH SPECTRA FOR COMPLEX NETWORKS PIET VAN MIEGHEM Delft University of Technology
CAMBRIDGE UNIVERSITY PRESS
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, S˜ ao Paulo, Delhi, Dubai, Tokyo, Mexico City Cambridge University Press The Edinburgh Building, Cambridge CB2 8RU, UK Published in the United States of America by Cambridge University Press, New York www.cambridge.org Information on this title: www.cambridge.org/9780521194587 c Cambridge University Press 2011 ° This publication is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 2011 Printed in the United Kingdom at the University Press, Cambridge A catalogue record for this publication is available from the British Library Library of Congress Cataloguing in Publication data ISBN 978-0-521-19458-7 Hardback
Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate.
to Saskia
who tolerated with love that science is a passionate and most demanding mistress
Contents
Preface
ix
Acknowledgements
xiii
Symbols 1
Introduction 1.1 1.2 1.3 1.4 Part I
2
Interpretation and contemplation Outline of the book Classes of graphs Outlook Spectra of graphs
13
Graph related matrices Walks and paths
13 25
General properties The number of walks Regular graphs Bounds for the largest, positive eigenvalue 1 Eigenvalue spacings Additional properties The stochastic matrix S = 1 D
Eigenvalues of the Laplacian T 4.1
2 5 7 10 11
Eigenvalues of the adjacency matrix 3.1 3.2 3.3 3.4 3.5 3.6 3.7
4
1
Algebraic graph theory 2.1 2.2
3
xv
29 29 33 43 46 55 58 63 67
General properties
67 v
vi
Contents 4.2 4.3 4.4 4.5 4.6
5
Spectra of special types of graphs 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10 5.11 5.12
6
The complete graph A small-world graph A circuit on Q nodes A path of Q 1 hops A path of k hops The wheel ZQ +1 The complete bipartite graph Np>q A general bipartite graph Complete multi-partite graph An p-fully meshed star topology A chain of cliques The lattice
Density function of the eigenvalues 6.1 6.2 6.3 6.4 6.5
7
Second smallest eigenvalue of the Laplacian T Partitioning of a graph The modularity and the modularity matrix P Bounds for the diameter Eigenvalues of graphs and subgraphs
Definitions The density when Q $ 4 Examples of spectral density functions Density of a sparse regular graph Random matrix theory
Spectra of complex networks 7.1 7.2 7.3 7.4 7.5 7.6 7.7 7.8
Simple observations Distribution of the Laplacian eigenvalues and of the degree Functional brain network Rewiring Watts-Strogatz small-world graphs Assortativity Reconstructability of complex networks Reaching consensus Spectral graph metrics
Part II 8
Eigensystem and polynomials
Eigensystem of a matrix 8.1 8.2
Eigenvalues and eigenvectors Functions of a matrix
80 89 96 108 109 115 115 115 123 124 129 129 129 131 135 138 147 154 159 159 161 163 166 169 179 179 181 184 185 187 196 199 200 209 211 211 219
Contents 8.3 8.4 8.5 8.6 8.7 8.8 8.9 9
Polynomials with real coe!cients 9.1 9.2 9.3 9.4 9.5 9.6 9.7 9.8 9.9 9.10 9.11
10
Hermitian and real symmetric matrices Vector and matrix norms Non-negative matrices Positive (semi) definiteness Interlacing Eigenstructure of the product DE Formulae of determinants
General properties Transforming polynomials Interpolation The Euclidean algorithm Descartes’ rule of signs The number of real zeros in an interval Locations of zeros in the complex plane Zeros of complex functions Bounds on values of a polynomial Bounds for the spacing between zeros Bounds on the zeros of a polynomial
Orthogonal polynomials 10.1 10.2 10.3 10.4 10.5 10.6
Definitions Properties The three-term recursion Zeros of orthogonal polynomials Gaussian quadrature The Jacobi matrix
vii 222 230 235 240 243 252 255 263 263 270 274 277 282 292 295 302 305 306 308 313 313 315 317 323 326 331
References
339
Index
345
Preface During the first years of the third millennium, considerable interest arose in complex networks such as the Internet, the world-wide web, biological networks, utility infrastructures (for transport of energy, waste, water, trains, cars and aircrafts), social networks, human brain networks, and so on. It was realized that complex networks are omnipresent and of crucial importance to humanity, whose still augmenting living standards increasingly depend on complex networks. Around the beginning of the new era, general laws such as “preferential attachment” and the “power law of the degree” were observed in many, totally dierent complex networks. This fascinating coincidence gave birth to an area of new research that is still continuing today. But, as is often the case in science, deeper investigations lead to more questions and to the conclusion that so little is understood of (large) networks. For example, the rather simple but highly relevant question “What is a robust network?” seems beyond the realm of present understanding. The most natural way to embark on solving the question consists of proposing a set of metrics that tend to specify and quantify “robustness”. Soon one discovers that there is no universal set of metrics, and that the metrics of any set are dependent on each other and on the structure of the network. Any complex network can be represented by a graph. Any graph can be represented by an adjacency matrix, from which other matrices such as the Laplacian are derived. These graph related matrices are defined in Chapter 2. One of the most beautiful aspects of linear algebra is the notion that, to each matrix, a set of eigenvalues with corresponding eigenvectors can be associated. The physical meaning of an “eigen” system is best understood by regarding the matrix as a geometric transformation of “points” in a space. Those “points” define a vector: a line segment from an origin that ends in the particular point and that is directed from origin to end. The transformation (rotation, translation, scaling) of the vector is again a vector in the same space, but generally dierent from the original vector. The vector that after the transformation turns out to be proportional with itself is called an eigenvector and the proportionality strength or the scaling factor is the eigenvalue. The Dutch and German adjective “eigen” means something that is inherent to itself, a characteristic or fundamental property. Thus, knowing that each graph is represented by a matrix, it is natural to investigate the “eigensystem”, the set of all eigenvalues with corresponding eigenvectors because the “eigensystem” characterizes the graph. Stronger even, since both the adjacency and Laplacian matrix are symmetric, there is a one-to-one correspondence between the matrix and the “eigensystem”, established in art. 151. In a broader context, transformations have proved very fruitful in science. The ix
x
Preface
most prominent is undoubtedly the Fourier (or Laplace) transform. Many branches of science ranging from mathematics, physics and engineering abound with examples that show the power and beauty of the Fourier transform. The general principle of such transforms is that one may study the problem in either of two domains: in the original one and in the domain after transformation, and that there exists a one-to-one correspondence between both domains. For example, a signal is a continuous function of time that may represent a message or some information produced over time. Some properties of the signal are more appropriately studied in the time-domain, while others are in the transformed domain, the frequency domain. This analogy motivates us to investigate some properties of a graph in the topology domain, represented by a graph consisting of a set of nodes connected by a set of links, while other properties may be more conveniently dealt with in the spectral domain, specified by the set of eigenvalues and eigenvectors. The duality between topology and spectral domain is, of course, not new and has been studied in the field of mathematics called algebraic graph theory. Several books on the topic, for example by Cvetkovi´c et al. (1995); Biggs (1996); Godsil and Royle (2001) and recently by Cvetkovi´c et al. (2009), have already appeared. Notwithstanding these books, the present one is dierent in a few aspects. First, I have tried to build-up the theory as a connected set of basic building blocks, called articles, which are abbreviated by art. The presentation in article-style was inspired by great scholars in past, such as Gauss (1801) in his great treatise Disquisitiones Arithmeticae, Titchmarsh (1964) in his Theory of Functions, and Hardy and Wright (1968) in their splendid Introduction to the Theory of Numbers, and many others that cannot be mentioned all. To some extent, it is a turning back to the past, where books were written for peers, and without exercise sections, which currently seem standard in almost all books. Thus, this book does not contain exercises. Second, the book focuses on general theory that applies to all graphs, and much less to particular graphs with special properties, of which the Petersen graph, shown in Fig. 2.3, is perhaps the champion among all. In that aspect, the book does not deal with a zoo of special graphs and their properties, but confines itself to a few classes of graphs that depend at least on a single parameter, such as the number of nodes, that can be varied. Complex networks all dier and vary in at least some parameters. Less justifiable is the omission of multigraphs, directed graphs and weighted graphs. Third, I have attempted to make the book as self-contained as possible and, as a peculiar consequence, the original appendices consumed about half of the book! Thus, I decided to create two parts, the main part I on the spectra, while part II overviews interesting results in linear algebra and the theory of polynomials that are used in part I. Since each chapter in part II discusses a wide area in mathematics, in fact, separate books on each topic are required. Hence, only the basic theory is discussed, while advanced topics are not covered, because the goal to include part II was to support part I. Beside being supportive, part II contains interesting theory that opens possibilities to advance spectral results. For example, Laguerre’s beautiful Theorem 51 may once be applied to the characteristic
Preface
xi
polynomials of a class of graphs with the same number of negative, positive and zero eigenvalues of the adjacency matrix. A drawback is that the book does not contain a detailed list of references pointing to the original, first published papers: it was not my intention to survey the literature on the spectra of graphs, but rather to write a cohesive manuscript on results and on methodology. Sometimes, dierent methods or new proofs of a same result are presented. The monograph by Cvetkovi´c et al. (1995), complemented by Cvetkovi´c et al. (2009), still remains the invaluable source for references and tables of graph spectra. The book is a temporal reflection of the current state of the art: during the process of writing, progress is being made. In particular, the many bounds that typify the field are continuously improved. The obvious expectation is that future progress will increasingly shape and fine-tune the field into — hopefully — maturity. Hence, the book will surely need to be updated and all input is most welcome. Finally, I hope that the book may be of use to others and that it may stimulate and excite people to dive into the fascinating world of complex networks with the rigorous devices of algebraic graph theory oered here.
Ars mathematicae
October 2010
Piet Van Mieghem
Acknowledgements
I would like to thank Huijuan Wang, for her general interest, input and help in pointing me to interesting articles. Further, I am most grateful to Fernando Kuipers for proofreading the first version of the manuscript, to Roeloef Koekoek for reviewing Chapter 10 on orthogonal polynomials, and to Jasmina Omic for the numerical evaluation of bounds on the largest eigenvalue of the adjacency matrix. Javier Martin Hernandez, Dajie Liu and Xin Ge have provided me with many nice pictures of graphs and plots of spectra. Stojan Trajanovski has helped me with the p-dimensional lattice and art. 105. Wynand Winterbach showed that the assortativity of regularly graphs is not necessarily equal to one, by pointing to the example of the complete graph minus one link (Section 7.5.1.1). Rob Kooij has constructed Fig. 4.1 as a counter example for the common belief that Fiedler’s algebraic connectivity is always an adequate metric for network robustness with respect to graph disconnectivity. As in my previous book (Van Mieghem, 2006b), David Hemsley has suggested a number of valuable textual improvements.
xiii
Symbols
Only when explicitly mentioned, will we deviate from the standard notation and symbols outlined here. Random variables and matrices are written with capital letters, while complex, real, integer, etc., variables are in lower case. For example, [ refers to a random variable, D to a matrix, whereas { is a real number and } is complex number. Usually, l> m> n> o> p> q are integers. Operations on random variables are denoted by [=], whereas (=) is used for real or complex variables. A set of elements is embraced by {=}.
Linear algebra 6 d11 · · · d1p 9 : q × p matrix 7 ... 8 5
D
dq1
det D trace(D) diag(dn ) DW D DK fD ({) adjD T () hm nm
===
dqp
¯ ¯ ¯ d11 · · · d1q ¯ ¯ ¯ ¯ ¯ determinant of a square matrix D; also denoted by ¯ ... ¯ ¯ ¯ ¯ d ¯ = = = d q1 qq Pq = m=1 dmm : sum of diagonal elements of D = diag(d1 > d2 > = = = > dq ): a diagonal matrix with diagonal elements listed, while all o-diagonal elements are zero transpose of a matrix, the rows of D are the columns of DW matrix in which each element is the complex conjugate of the corresponding element in D = (D )W : Hermitian of matrix D = det (D {L): characteristic polynomial of D = D1 det D: adjugate of D fD () = LD : adjoint of D basic vector, all components are zero, except for component m that is 1 Kronecker delta, nm = 1 if n = m, else nm = 0 xv
xvi
Pr [[] H [[] Var[[] i[ ({) I[ ({) *[ (})
{[n }1np [(n) S 1{{}
L N O Q NQ Nq>p gm g(m) gmax gmin G N (J) L (J) K D E T M x NJ {n }1nQ {n }1nQ Qn Zn
Symbols Probability theory probability of the event [ = : expectation of the random variable [ 2 = [ : variance of the random variable [ gI[ ({) = g{ : probability density function of [ probability distribution function of [ probability generating function of [ £ ¤ *[ (}) = H £} [ when [ is a discrete r.v. ¤ }[ *[ (}) = H h when [ is a continuous r.v. = {[1 > [2 > = = = > [p } n-th order statistics, n-th smallest value in the set {[n }1np transition probability matrix (Markov process) indicator function: 1{{} = 1 if the event or condition {{} is true, else 1{{} = 0. For example, nm = 1{n=m} Graph theory set of links in a graph set of nodes in a graph = |L|: number of links in a graph = |N |: number of nodes in a graph the complete graph with Q nodes the complete bi-partite graph with Q = q + p degree of node m the m-th largest degree of node in a graph maximum degree in the graph minimum degree in the graph degree in a graph (random variable) vertex (node) connectivity of graph J edge (link) connectivity of graph J hopcount in a graph (random variable) adjacency matrix of graph J incidence matrix of graph J = EE W Laplacian matrix of graph J all-one matrix all-one vector the number of triangles in J = diag(g1 > g2 > = = = > gQ ): diagonal matrix of the nodal degrees set of eigenvalues of D ordered as 1 2 · · · Q set of eigenvalues of T ordered as 1 2 · · · Q total number of walks with length n number of closed walks with length n
1 Introduction
Despite the fact that complex networks are the driving force behind the investigation of the spectra of graphs, it is not the purpose of this book to dwell on complex networks. A generally accepted, all-encompassing definition of a complex network does not seem to be available. Instead, complex networks are understood by instantiation: the Internet, transportation (car, train, airplane) and infrastructural (electricity, gas, water, sewer) networks, biological molecules, the human brain network, social networks, software dependency networks, are examples of complex networks. By now, there is such a large literature about complex networks, predominantly in the physics community, that providing a detailed survey is a daunting task. We content ourselves here with referring to some review articles by Strogatz (2001); Newman et al. (2001); Albert and Barabasi (2002); Newman (2003b), and to books in the field by Watts (1999); Barabasi (2002); Dorogovtsev and Mendes (2003); Barrat et al. (2008); Dehmer and Emmert-Streib (2009); Newman (2010), and to references in these works. Application of spectral graph theory to chemistry and physics are found in Cvetkovi´c et al. (1995, Chapter 8). Complex networks can be represented by a graph, denoted by J, consisting of a set N of Q nodes connected by a set L of O links. Sometimes, nodes and links are called vertices and edges, respectively, and are correspondingly denoted by the set Y and H. Here and in my book on Performance Analysis (Van Mieghem, 2006b), a graph is denoted by J (N > L) or J (Q> O) to avoid conflicts with the expectation operator H in probability theory. There is no universal notation of a graph, although in graph theory J = (Y> H) often occurs, while in network theory and other applied fields, nodes and links are used and the notation J (Q> O) appears. None of these notations is ideal nor optimized, but fortunately in most cases, the notation J for a graph seems su!cient. Graphs, in turn, can be represented by a matrix (art. 1). The simplest among these graph-associated matrices is the adjacency matrix D, whose entries or elements are dlm = 1{node
l is connected to node m}
(1.1)
where 1{ is the indicator function and equal to one if the { is true, else it is zero. 1
2
Introduction
All elements dlm of the adjacency matrix are thus either 1 or 0 and D is symmetric for undirected graphs. Unless mentioned otherwise, we assume in this book that the graph is undirected and that D (and other graph-associated matrices) are symmetric. If the graph consists of Q nodes and O links, then art. 151 demonstrates that the Q × Q symmetric adjacency matrix can be written as D = [[ W
(1.2)
where the Q ×Q orthogonal matrix [ contains as columns the eigenvectors {1 > {2 ,..., {Q of D belonging to the real eigenvalues 1 2 = = = Q and where the matrix = diag(n ). This basic relation (1.2) equates the topology domain, represented by the adjacency matrix, to the spectral domain of the graph, represented by the eigensystem in terms of the orthogonal matrix [ of eigenvectors and the diagonal matrix with corresponding eigenvalues. The major di!culty lies in the map from topology to spectral domain, D $ [[ W , because the inverse map from spectral to topology domain, [[ W $ D, consists of straightforward matrix multiplications. Thus, most of the eorts in this book lie in computing or deducing properties of [ and , given D. Even more confining, most energy is devoted to and the distribution and properties of the eigenvalues {m }1mQ of D and of other graph related matrices. It is fair to say that not too much is known about the eigenvectors and the distribution and properties of eigenvector components. A state of the current art is presented by Cvetkovi´c et al. (1997).
1.1 Interpretation and contemplation One of the most studied eigenvalue problems is the stationary Schrödinger equation in quantum mechanics (see, e.g., Cohen-Tannoudji et al. (1977)), K* (u) = H* (u) where * (u) is the wave function, H is the energy eigenvalue of the Hamiltonian (linear) dierential operator K=
}2 + Y (u) 2p 2
2
2
C C C k in which the Laplacian operator is = C{ 2 + C| 2 + C} 2 , } = 2 and k ' 6=62 × 34 10 Js is Planck’s constant, p is the mass of an object subject to a potential field Y (u) and u is a three-dimensional location vector. The wave function * (u) is generally complex, but |* (u)|2 represents the density function of the probability that the object is found at position u. The mathematical theory of second-order linear dierential operators is treated, for instance, by Titchmarsh (1962, 1958). While the interpretation of the eigenfunction * (u) of the Hamiltonian K, the continuous counterpart of an eigenvector with discrete components, and its corresponding energy eigenvalue H is well understood, the meaning of an eigenvector of a graph is rather vague and not satisfactory. An attempt is as follows. The basic
1.1 Interpretation and contemplation
3
equation (8.1) of the eigenvalue problem, D{ = {, combined with the zero-one nature of the adjacency matrix D, states that the m-th component of the eigenvector {n belonging to eigenvalue n can be written as n ({n )m = (D{n )m =
Q X
X
dmo ({n )o =
o=1
({n )o
(1.3)
o is a direct neighb or of m
Since dmm = 0, the eigenvector component ({n )m weighted (multiplied) by the eigenvalue n equals the sum of the other eigenvector components ({n )o over all direct neighbors o of node m. Since all eigenvectors are orthogonal1 , each eigenvector can be interpreted as describing a dierent inherent property of the graph. What that property means is yet unclear, but the eigenvalue basic equation (1.2) says that there are only Q such inherent properties, and the orthogonality of [ or of the eigenvectors tells us that these inherent properties are independent. The above component equation (1.3) then expresses that the value ({n )m of the inherent property n, belonging to the eigenvalue n and specified by the eigenvector {n , at each node m equals a weighted sum of those values ({n )o over all its direct neighbors o, and each such sum has a same weight 1 n (provided n 6= 0, else one may say that the average over all direct neighbors of those values ({n )o is zero). Since both sides of the basic equation (8.1), D{ = {, can be multiplied by some non-zero number or quantity, we may interpret that the value of property n is expressed in dierent “physical” units. Perhaps, depending on the nature of the complex network, some of these units can be determined or discovered, but the pure mathematical description (8.1) of the eigenvalue problem does not contain this information. Although the focus here is on eigenvectors, equation (1.3) also provides interesting information about the eigenvalues, for which we refer to art. 172. Equation (1.3) reflects a local property with value ({n )m that only depends the corresponding values ({n )o of direct neighbors. But this local property for node m holds globally for any node m, with a same strength or factor n . This local and global aspect of the eigenstructure is another fascinating observation, that is conserved after “self-replication”. Indeed, using (1.3) with index m = o into (1.3) yields 2n ({n )m =
Q X o1 =1
dmo1
Q X o2 =1
= gm ({n )m +
do1 o2 ({n )o2 = X
Q X ¡ 2¢ D mo2 ({n )o2
o2 =1
({n )o2
o2 is a second hop neighb or of m
¢ ¡ ¢ ¡ P PQ 2 W , since (see art. 30) D2 mm = Q n=1 dmn dnm = n=1 dmn by symmetry D = D PQ PQ 2 and n=1 dmn = n=1 dmn = gm due to the zero-one nature of dlm , and where gm is the degree, the number of neighbors, of node m. The idea can be continued and a 1
Mathematically, the eigenvectors form an orthogonal basis that spans the entire Q-dimensional space. Each eigenvector “adds” or specifies one dimension or one axis (orthogonal to all others) in that Q-dimensional coordinate frame.
4
Introduction
subsequent substitution of (1.3) leads to an expression that involves a sum over all three hops nodes away from node m. Subsequent iterations relate the expansion of the graph around node m in the number of hops p, further elaborated in art. 17 and art. 36, to the eigenvalue structure as n o X p p (D ) ({n )op (1.4) n mm ({n )m = op is an p-th hop neighb or of m
Again, this local expansion around node m holds globally for any node m. The alternative representation (8.31) D=
Q X
n {n {Wn
n=1
shows that there is a hierarchy in importance of the properties, specified by the absolute value of the eigenvalues, because all eigenvectors are scaled to have equal unit norm. In particular, possible zero eigenvalues contain properties that the graph does not possess, because the corresponding eigenvectors do not contribute to the structure — the adjacency matrix D — of the graph. In contrast, the properties belonging to the largest (in absolute value) eigenvalues have a definite and strong influence on the graph structure. Another observation2 is that the definition of the adjacency matrix D is somewhat arbitrary. Indeed, we may agree to assign the value to the existence of a link and otherwise, where and 6= can be any complex number. Clearly, the graph is then equally well described by a new adjacency matrix D (> ) = ( ) D + M, where M is the all-one matrix. Unless = 1 and = 0, the eigenvalues and eigenvectors of D (> ) are dierent from those of D. This implies that an entirely dierent, but still consistent theory of the spectra of graphs can be built. We have not pursued this track here, although we believe that for certain problems a more appropriate choice of and may simplify the solution. When encountering the subject for the first time, one may be wondering where all the energy is spent, because the problem of finding the eigenvalues of D, reviewed in Chapter 8, basically boils down to solving the zeros of the associated characteristic polynomial (art. 138). In addition, we know (art. 1), due to symmetry of D, that all zeros are real, a fact that considerably simplifies matters as shown in Chapter 9. For, nearly all of the polynomials with real coe!cients possess complex zeros, and only a very small subset has zeros that are all real. This suggests that there must be something special about these eigenvalues and characteristic polynomials of D. There is one most fascinating class of polynomials with real coe!cients whose zeros are all real: orthogonal polynomials, which are studied in Chapter 10. In some particular cases, there is, indeed, a relation between the spectrum (eigenvalues) of the graph and the zeros of orthogonal polynomials. Much of the research in the spectral analysis of graphs is devoted to understand 2
Communicated to me by Dajie Liu.
1.2 Outline of the book
5
Fig. 1.1. A realization of an Erd˝os-Rényi random graph Js (Q) with Q = 400 nodes, of about 4. The link density s ' 1032 equals the O = 793 links and average degree 2O Q probability to have a link between two arbitrary chosen nodes in Js (Q). The size of a node is drawn proportional to its degree.
properties of the graph by inspecting the spectra of mainly two matrices, the adjacency matrix D and the Laplacian T, defined in art. 2. For example, how does the spectrum show that a graph is connected? What is the physical meaning of the largest and smallest eigenvalue, how large or small can they be? How are eigenvalues changing when nodes and/or links are added to the graph? Deeper questions are, “Is alone, without [ in (1.2), su!cient to characterize a graph?”, “How are the spacings, the dierences between consecutive eigenvalues, distributed and what do spacings physically mean?”, or, extremal problems as “What is the class of graphs on Q nodes and O links that achieves the largest second smallest eigenvalue of the Laplacian?”, and so on.
1.2 Outline of the book Chapter 2 introduces some definitions and concepts of algebraic graph theory, which are needed in Part I. We embark on the subject in Chapter 3 that focuses on the eigenvalues of the adjacency matrix D. In Chapter 4, we continue with the investigation of the spectrum of the Laplacian T. As argued by Mohar, the theory of the Laplacian spectrum is richer and contains more beautiful achievements than that of the adjacency matrix. In Chapter 5, we compute the entire adjacency spectrum and sometimes also the Laplacian spectrum of special types of classes containing at least one variable parameter such as the number of nodes Q or/and
6
Introduction
Fig. 1.2. An instance of a Barabási-Albert graph with Q = 400 nodes and O = 780 links, which is about the same as in Fig. 1.1. The size of a node is drawn proportional to its degree.
Fig. 1.3. The Watts-Strogatz small world graph on Q = 100 nodes and with nodal degree 1 G = 4 (or n = 2 as explained in Section 5.2) and rewiring probability su = 100 .
the number links O. This chapter thus illustrates the theory of Chapter 3 and Chapter 4 by useful examples. In fact, the book originated from Chapter 5 and it was a goal to collect all spectra of graphs (with at least one parameter that can be varied). The underlying thought was to explain the spectrum of a complex network
1.3 Classes of graphs
7
by features appearing in “known spectra”. Chapter 6 complements Chapter 5 asymptotically when graphs grow large, Q $ 4. For large graphs, the density or distribution of the eigenvalues (as nearly continuous variables) is more appealing and informative than the long list of eigenvalues. Apart from the three marvelous scaling laws by Wigner, Mar˘cenko-Pastur and McKay, we did not find many explicit results on densities of eigenvalues of graphs. Finally, Chapter 7, the last chapter of Part I, applies the spectral knowledge of the previous chapters to gain physical insight into the nature of complex networks. As mentioned in the Preface, the results derived in Part I have been built on the general theory of linear algebra and of polynomials with real coe!cients summarized in Part II.
Fig. 1.4. A Barabási “fractal-like” tree with Q = 1000 nodes, grown by adding at each step one new node to nodes already in the tree and proportional to their degree.
1.3 Classes of graphs The main classes of graphs in the study of complex networks are: the class of Erd˝os-Rényi random graphs (Fig. 1.1), whose fascinating properties are derived in Bollobas (2001); the class of Watts-Strogatz small-world graphs (Fig. 1.3) first explored in Watts (1999); the class of Barabási-Albert power law graphs (Fig. 1.2 and Fig. 1.4) introduced by Barabási and Albert (1999); and the regular hyperlattices in several dimensions. The Erd˝os-Rényi random graph is the simplest random model for a network. Its
8
Introduction
analytic tractability in a wide range of graph problems has resulted in the richest and most beautiful theory among classes of graphs. In many cases, the Erd˝os-Rényi random graph serves as a basic model that provides a fast benchmark for first order estimates and behaviors in real networks. Usually, if a graph problem cannot be solved analytically for the Erd˝os-Rényi random graph or for hyper-lattices, few hope exists that other classes of (random) graphs may have a solution. However, in particular the degree distribution of complex networks does not match well with the binomial degree distribution of Erd˝os-Rényi random graphs (drawn in Fig. 1.5) and this observation has spurred the search for “more realistic models”.
4
0.4
fit: Pr[D = k] = c k
2
-2.3
-1
Pr[D = k]
10
Pr[D = k]
0.3
4 2 -2
10
4 2
0.2
-3
10
2
3
4
5
6
7 8 9
2
3
10 degree k of node
0.1
Erdos-Renyi random graph Barabasi-Albert power law graph Binomial(N-1,p)
0.0 0
5
10
15
20
25
30
35
degree k of node
Fig. 1.5. The probability density function (pdf) of the nodal degree in the Erd˝os-Rényi random graph shown in Fig. 1.1 and in the Barabási-Albert power law graph in Fig. 1.2.
The Watts-Strogatz small-world graphs (after random rewiring of links) possesses a relatively high clustering and short hopcount. The probability su that a link is rewired seems to be a powerful tool in Watts-Strogatz small-world graphs to balance between “long hopcounts” (su is small) and “small-worlds” (su $ 1). The most distinguishing property of the Barabási-Albert power law graphs is the power law degree distribution, Pr [G = n] fn with power index 3 for large Q where f is a normalization constant, which is observed as a major characteristic in many real-world complex networks. Fig. 1.5 compares the degree distribution of the Erd˝os-Rényi random graph shown in Fig. 1.1 and of the Barabási-Albert power law graph in Fig. 1.2, both with the same number of nodes (Q = 400) and almost the same average degree (H [G] = 4). The insert illustrates the characteristic power law of the Barabási-Albert graph, recognized by a straight line in a log-log plot. Most nodes in the Barabási-Albert power law graph have small degree, while a few nodes have degree larger than 10 (which is the maximum degree in the
1.3 Classes of graphs
9
Erd˝os-Rényi random graph with same number of nodes and links), and even one node has 36 neighbors. A power law graph is often called a “scale-free graph”, meaning p that there is no typical scale for the degree. Thus, the standard deviation G = Var [G] is usually larger than the average H [G], such that the latter is not a good estimate for the random variable G of the degree, in contrast to Gaussian or binomial distributions, where the bell-shape is centered around the mean with, usually, small variance. Physically, power law behavior can be explained by the notion of long-range dependence, heavy correlations over large spacial or temporal intervals, and of self-similarity. A property is self-similar if on various scales (in time or space) or aggregation levels (e.g., hierarchical structuring of nodes in a network) about the same behavior is observed. The result is that a local property is magnified or scaled-up£towards a ¤global extent. Mathematically, Pr [G = n] f n , from which Pr 1 G = n = Pr [G = n]; scaling the property (here, the degree G) by a factor 1 leads to precisely the same distribution, apart from a proportionality constant . Thus, on dierent scales, the behavior “looks” similar. There is also a large number of more dedicated classes, such as Ramanujan graphs and the Kautz graphs, shown in Fig. 1.6, that possess interesting extremal properties. We will not further elaborate on the dierent properties of these classes;
Fig. 1.6. The Kautz graph of degree g = 3 and of dimension q = 3 has (g + 1) gq nodes and (g + 1) gq+1 links. The Kautz graph has the smallest diameter of any possible directed graph with Q nodes and degree g.
we have merely included some of them here to illustrate that complex networks are
10
Introduction
studied by comparing observed characteristics to those of “classes of graphs with known properties”.
1.4 Outlook I believe that we still do not understand “networks” su!ciently. For example, if the data (e.g., the adjacency matrix) of a large graph is given, and you are not allowed to visualize the network, it seems quite complex to tell, by computing graph metrics only, what the properties of the network are. You may list a large number of topological metrics such as hopcount, eccentricity, diameter, girth, expansion, betweenness, distortion, degree, assortativity, coreness, clique number, clustering coe!cient, vertex and edge connectivity and others. We as humans see a pile of numbers, but often miss the overall picture and understanding. I believe that the spectrum, that is for a su!ciently large graph a unique fingerprint as conjectured in van Dam and Haemers (2003), may reveal much more. First, graph or topology metrics are generally correlated and dependent. In contrast, eigenvalues weigh the importance of eigenvectors, that are all orthogonal, which makes the spectrum a more desirable device. Second, the belief in the spectrum stems from earlier research in condensed matter (Borghs et al., 1989), where we have deduced from the photoluminescence spectra, quite useful and precise information about the structural properties of doped GaAs substrates. By inspecting long and carefully the dierences in peaks and valleys, in gaps and in the broadness of the distribution of eigenvalues, that physically represented energy levels in the solid described by Schrödinger’s equation in Section 1.1, insight gradually arose. A similar track may be followed to understand real, complex networks, because at the time of writing, “reading and understanding” the spectrum of a graph seems beyond our ability. We hope that the mathematical properties of spectra, presented here, may help in achieving this goal.
Part I Spectra of graphs
2 Algebraic graph theory
The elementary basics of the matrix theory for graphs J (Q> O) is outlined. The books by Cvetkovi´c et al. (1995) and Biggs (1996) are standard works on algebraic graph theory.
2.1 Graph related matrices 1. The adjacency matrix D of a graph J with Q nodes is an Q × Q matrix with elements dlm = 1 only if the pair of nodes (l> m) is connected by a link of J, otherwise dlm = 0. If the graph is undirected, the existence of a link implies that dlm = dml , the adjacency matrix D = DW is a real symmetric matrix. It is assumed further that the graph J does not contain self-loops (dll = 0) nor multiple links between two nodes. The complement Jf of the graph J consists of the same set of nodes but with a link between (l> m) if there is no link (l> m) in J and vice versa. Thus, (Jf )f = J and the adjacency matrix Df of the complement Jf is Df = M L D where M is the all-one matrix ((M)lm = 1). The links in a graph can be numbered 1
3 4
2 6
5
Fig. 2.1. A graph with Q = 6 and O = 9. The links are lexicographically ordered, h1 = 1 < 2> h2 = 1 < 3> h3 = 1 {3 6, etc.
in some way, for example, lexicographically as illustrated in Fig. 2.1. Information about the direction of the links is specified by the incidence matrix E, an Q × O matrix with elements ; ? 1 if link ho = l $ m elo = 1 if link ho = l # m = 0 otherwise 13
14
Algebraic graph theory
Fig. 2.1 exemplifies the definition of D and E: 5 9 9 9 D=9 9 7
0 1 1 0 0 1
1 0 1 0 1 1
1 1 0 1 0 0
0 0 1 0 1 0
0 1 0 1 0 1
1 1 0 0 1 0
6
5 1 : 9 31 : 9 : 9 0 : > E =9 0 : 9 8 7 0 0
31 0 0 0 0 1
1 0 31 0 0 0
0 1 31 0 0 0
0 31 0 0 1 0
0 1 0 0 0 31
0 0 1 31 0 0
0 0 0 31 1 0
0 0 0 0 31 1
6 : : : : : 8
An important property of the incidence matrix E is that the sum of the columns equals zero, xW E = 0
(2.1)
where x = (1> 1> = = = > 1) is the all-one vector. An undirected graph can be represented by an Q × (2O) incidence matrix E, where each link (l> m) is counted twice, once for the direction l $ m and once for the direction m $ l. In that case, the degree of each node is just doubled. Instead of using the incidence matrix, the unsigned incidence matrix U, defined in art. 7, can be more appropriate. 2. The relation between adjacency and incidence matrix is given by the admittance matrix or Laplacian T, T = EE W = D where = diag(g1 > g2 > = = = > gQ ) is the degree matrix. Indeed, if l 6= m and noting that each column has precisely two non-zero elements at a dierent row, ½ O X ¢ ¡ 1 if (l> m) are linked W tlm = EE lm = eln emn = 0 if (l> m) are not linked PO
n=1
If l = m, then n=1 e2ln = gl , the number of links that have node l in common. By the definition of D, the row sum l of D equals the degree gl of node l, gl =
Q X
dln
(2.2)
n=1
P Consequently, each row sum Q n=1 tln = 0, which shows that T is singular, implying that det T = 0. P PQ Since Q l=1 n=1 dln = 2O, the basic law for the degree follows as Q X
gl = 2O
(2.3)
l=1
Probabilistically, when considering an arbitrary nodal degree G — thus, G is viewed as a random variable of the degree in a graph with possible realization or outcome equal to one of the values g1 > g2 > = = = > gQ —, the basic law for the degree equals H [G] =
2O Q
2.1 Graph related matrices
15
meaning that the average degree or expectation of G in any graph J is twice the ratio of the number O of links over the number Q of nodes. Especially, in large real-world networks, a probabilistic approach is adequate as illustrated in Section 7. £ ¤W Let us define the degree vector g = g1 g2 · · · gQ , then both (2.2) and (2.3) have a compact vector presentation as Dx = g
(2.4)
xW Dx = gW x = 2O
(2.5)
and
3. Many other graph related matrices can be defined. We mention as an example the distance matrix K, where the element Klm is equal to the shortest distance (in hops) between node l and node m and the modularity matrix P , defined in art. 104. The matrix S = 1 D is a stochastic matrix because all elements of S lie in the interval [0> 1] and each row sum is 1. Often weighted graphs are considered, defined by a non-negative adjacency matrix Z , where each element zlm represents the weight of a link between node l and m and zmm = 0 for all 1 m Q . A particular class of weighted graphs are undiW rected weighted graphs, where Z = Z the corresponding weighted ³P. Similarly, ´ Q ˜ = diag Laplacian can be defined as T z Z , thus t˜lm = zlm if l 6= m, m=1 lm PQ else, t˜mm = l=1;l6=m t˜ml . 2.1.1 The incidence matrix E The Q × O incidence matrix E transforms a O × 1 vector | of the “link”-space to a Q × 1 vector { of the “nodal” space by { = E|. Physically, this transformation is best understood when | is a flow or current vector in a network. Then, the row PO (E|)l = n=1 Eln |n = {l equals the sum of the in-flows and out-flows at node l. Left-multiplying both sides of { = E| by xW and using (2.1) yields xW { = 0, which means that the net flow, influx plus outflow, in the network is zero. Thus, E| = { reflects a conservation law: the demand {l oered at node l in the network is balanced by the sum of currents or flows at node l and the net demand or influx (outflow) to the network is zero. 4. Rank of the incidence matrix E. Theorem 1 If the network J is connected, then rank(E) = Q 1. Proof: The basic property (2.1) implies that rank(E) Q 1. Suppose that there exists a non-zero vector { 6= x for any real number such that {W E = 0. Under that assumption, the vector x and { are independent and the kernel (or zero space of E) consisting of all vectors y such that yW E = 0 has at least rank 2,
16
Algebraic graph theory
and consequently rank(E) Q 2. We will show that { is not independent, but proportional to x. Consider row m in E corresponding to the non-zero component {m . All non-zero elements in the row vector (E)m are links incident to node m. Since each column of E only consists of two elements (with opposite signs), for each link o incident to node m, there is precisely one other row n in E with a non-zero element in column o. In order for the linear relation {W E = 0 to hold, we thus conclude that {m = {n , and this observation holds for all nodal indices m and n because J is connected. This implies that {W E = xW E, which shows that the rank of the incidence matrix cannot be lower than Q 1. ¤ An immediate consequence is that rank(E) = Q n if the graph has n disjoint but connected components, because then (see also art. 80) there exists a relabeling of the nodes such that E can be partitioned as 5 6 E1 R = = = R 9 .. : 9 R E2 . : : E=9 9 . : .. 7 .. 8 . R
= = = En
5. The cycle-space and cut-space of a graph J. The cycle-space of a graph J consists of all possible cycles in that graph. A cycle1 of length n from node l back to node l is a succession of n undirected links of the form (q0 q1 )(q1 q2 ) · · · (qn1 q0 ), where q0 = l. A cycle can have two cycle orientations. This means that the orientation of links in a cycle either coincides with the cycle orientation or that it is the reverse of the cycle orientation. For example, the cycle (1 2) (2 6) (6 1) in Fig. 2.1 corresponds to the links (columns in E) 1> 3 and 6 and all links are oriented in a same direction along the cycle. When adding columns 1> 3 and 6, the sum is zero, which is equivalent to E| = 0 with | = (1> 0> 1> 0> 0> 1> 0> 0> 0). On the other hand, the cycle (1 2) (2 3) (3 1) corresponds to the links 1> 2 and 4, but not all links are oriented in the same direction such that | = (1> 1> 0> 1> 0> 0> 0> 0> 0) has now negative sign components. In general, if E| = 0, then the non-zero components of the vector | are links of a cycle. Indeed, consider the m-th row (E|)m = {m . If node m is not incident with links of the cycle, then {m = 0. If node m is incident with some links of the cycle, then it is incident with precisely two links, with opposite sign such that {m is again zero. Since the rank of E is Q n (where n is the number of connected components), the rank of the kernel (or null space) of E is O Q + n. Hence, the dimension of the cycle-space of a graph equals the rank of the kernel of E, which is O Q + n. The orthogonal complement of cycle-space is called the cut-space, with dimension Q n. Thus, the cut-space is the space consisting of all vectors | for which E| = { 6= 0. Since xW { = 0, the non-negative components of { are the nodes belonging to one 1
Art. 17 defines a walk, from which it follows that a cycle is a closed walk, but a cycle is slightly more because the direction of a link (qn 3 qn+1 ) can be either (qn < qn+1 ) or (qn {3 qn+1 ).
2.1 Graph related matrices
17
partition and the negative components define the other partition. These two disjoint sets (or£ partitions) of nodes thus¤ define a cut in the graph. For example in Fig. 2.1, Ex = 1 0 1 2 1 1 defines a cut that separates nodes 3 and 4 from the rest. Section 4.3 further investigates the partitioning of a graph. 6. Spanning trees and the incidence matrix E. Consider the incidence matrix E of a graph J and an arbitrary row in E, corresponding to a node q. Let Pq ¢ ¡ remove be one of the QO1 square (Q 1) × (Q 1) submatrices of E without row q and let Jq denote the subgraph of J on Q 1 nodes formed by the links in the columns of Pq . Since there are Q 1 columns in Pq , the subgraph Jq has precisely Q 1 links, where some links may start or end at node q, outside the node set of Jq . We will now investigate det Pq . (a) Suppose first that there is no node with degree 1 in J, except possibly for q, in which case Jq is not a tree spanning Q 1 nodes. Since the number of links is O (Jq ) = Q 1, the basic law of the degree (2.3) shows that there must be a zero degree node in Jq . If the zero degree node is not q, then Jq has a zero row and det Pq = 0. If q is the zero degree node, then each column of Pq contains a 1 and 1. Thus, each row sum of Pq is zero and det Pq = 0. (b) In the other case, Jq has a node l with degree 1. Then, the l-th row in Jq only has one non-zero element, either 1 or 1. After expanding det Pq by this l-th row, we obtain a new (Q 2) × (Q 2) determinant Pq;l corresponding to the graph Jq:l , formed by the links in the columns of Pq;l . For det Pq;l , we can repeat the analysis: either Jq:l is not a tree spanning the Q 2 nodes of J except for q and l, in which case det Pq;l = 0 or det Pq;l = ± det Pq;l;n . Iterating this process shows that the determinant of any square (Q 1)×(Q 1) submatrix of E is either 0, when the corresponding graph formed by the links, corresponding to the columns in E is not a spanning tree, or ±1, when that corresponding graph is a spanning tree. Thus, we have shown: Theorem 2 (Poincaré) The determinant of any square submatrix of the incidence matrix E is either 0, 1, or 1. If the determinant of any square submatrix of a matrix is 0, 1, or 1, then that matrix is said to be totally unimodular.
2.1.2 The line graph 7. The line graph o (J) of the graph J (Q> O) has as set of nodes the links of J and two nodes in o (J) are adjacent if and only if they have, as links in J, exactly one node of J in common. The line graph o (J) of J is sometimes called the “dual graph” or the “derived graph” of J. For example, the line graph of the star N1>q is the complete graph Nq and the line graph of the example graph in Fig. 2.1 is drawn in Fig. 2.2.
18
Algebraic graph theory 9
8
1
2
7 6
5
4
3
Fig. 2.2. The line graph of the graph drawn in Fig. 2.1.
We denote by U the absolute value of the incidence matrix E, i.e., ulm = |elm |. In other words, ulm = 1 if node l and link m are incident, otherwise ulm = 0. Hence, the unsigned incidence matrix U ignores the direction of links in the graph, in contrast to the incidence matrix E. Analogous the definition of the Laplacian in art. 2, we may verify that the Q × Q adjacency matrix D of the graph J is written in terms of the unsigned Q × O node-link incidence matrix U as D = UUW
(2.6)
The O × O adjacency matrix of the line graph o (J) is similarly written in terms of U as Do(J) = UW U 2L
(2.7)
We remark that E W E is generally a (1> 0> 1)-matrix, and that taking the absolute value of its entries equals UW U, whereas the Laplacian matrix T = 2 UUW = EE W . In a graph J, where multiple links with the same direction between two nodes are excluded, we consider ; Q ? 1 if both link l and m either start or end in node q X ¡ W ¢ E E lm = eql eqm = 1 if either link l or m starts or ends in node q = q=1 2 if link l and m have two nodes in common ¡ ¢ The latter case, where E W E lm = 2, occurs for a bidirectional link between two nodes. When the ¡ links¢ at each node of the graph J either all start or all end, we observe that E W E lm = 1 for all links l and m and, in that case, there holds that E W E = UW U. An interesting example of such a graph is the general bipartite graph, studied in Section 5.8, where the direction of the links is the same for each node in the set M to each node in the other set N . 8. Basic properties of the line graph. The number of nodes in the line graph o (J) equals O, the number of links in J. The number of links in the line graph o (J) is computed from the basic law of the degree (2.5) and (2.7) with x the O × 1 all-one
2.1 Graph related matrices
19
vector as 1 W 1 x Do(J) x = xW UW Ux xW x 2 2 1 2 = kUxk2 O 2
Oo(J) =
It follows from the definition of the unsigned incidence matrix U that xW1×Q U = 2xWO×1 , which is the companion of (2.1), and that Ux = g, because the row sum of PO o=1 Ulo = gl , the number of links in J incident to node l. Hence, we find that the number of links in the line graph o (J) equals 1 W 1X 2 g gO= g O 2 2 l=1 l Q
Oo(J) =
(2.8)
Alternatively, each node l in J with degree gl generates in the line graph o (J) precisely corresponding ¡ ¢ gl nodes that are all connected to each other (as in a clique), ¡gl ¢ P to g2l links. The number of links in o (J) is thus also Oo(J) = Q l=1 2 . Art. 2 indicates that the average degree of a node in the line graph o (J) is Q £ ¤ 2Oo(J) 1X 2 H Go(J) = = g 2 Qo(J) O l=1 l
The degree vector of the line graph o (J) follows from (2.4) as go(J) = Do(J) xO×1 = UW Ux 2x = UW g 2x Since in each column of U (as in the matrix E), there are only two non¡ incidence ¢ zero elements, the vector element UW g o = go+ + go , where o+ denotes the node at the start and o the node at the end of the link o. Hence, the maximum (and similarly minimum) degree of the line graph o (J) equals max go(J) = max (go+ + go 2) g(1) + g(2) 2 1oO
where g(n) denotes the n-th largest degree in J. When J is connected, then also o (J) is connected as follows from the construction2 (or definition) of the line graph o (J). Given a line graph o (J), it is possible to reconstruct the original graph J. The reconstruction or the inverse J = o1 (o (J)) is not so easy. Each link o in J connects two nodes l and m and is transformed in the line graph o (J) to a node o that bridges two cliques Ngl and Ngm . If a line graph o (J) can be partitioned into cliques, then the number of those cliques equals the number Q of nodes in J and each node o in o (J) that bridges two cliques l and m, corresponds to a link o in J between two nodes l and m. Apart from J = N3 , the reconstruction or inverse line graph o1 (J) 2
In a connected graph J, each node is reachable from any other node via a path (a sequence of adjacent links, art. 17). Similarly, in the dual setting corresponding to the line graph, each link in J is reachable from any other link via a path (a sequence of adjacent nodes or neighbors).
20
Algebraic graph theory
is unique. Algorithms to compute the original graph J from the line graph o (J) are presented by Lehot (1974) and Roussopoulos (1973). 9. Since UW U is a Gram matrix (art. 175), all eigenvalues of UW U are non-negative. Hence, it follows from (2.7) that the eigenvalues of the adjacency matrix of the line graph o (J) are not smaller than 2. The adjacency spectra of the line graph o (J) and of J are related by Lemma 10 since ³¡ ´ ³¡ ´ ¢ ¢ det UW U O×O L = OQ det UUW Q×Q L Using the definitions (2.7) and (2.6) in art. 7 yields ¢ ¡ det Do(J) ( 2) L = OQ det ( + D L) or
¢ ¡ OQ det ( + D ( + 2) L) det Do(J) L = ( + 2)
(2.9)
The eigenvalues of the adjacency matrix of the line graph o (J) are those of the unsigned Laplacian +D shifted over 2 and an eigenvalue at 2 with multiplicity O Q. If E W E = UW U, then we have by Lemma 10 that ´ ³¡ ´ ³¡ ¢ ¢ det E W E O×O L = OQ det EE W Q ×Q L from which
or
¡ ¢ det (T L) = Q O det Do(J) ( 2) L ¢ ¡ det Do(J) L = ( + 2)OQ det (T ( + 2) L)
(2.10)
In graphs J, where E W E = UW U, the eigenvalues of the adjacency matrix of the line graph o (J) are those of the Laplacian T = D shifted over 2 and an eigenvalue at 2 with multiplicity O Q . The restriction, that all eigenvalues of an adjacency matrix are not less than 2, is not su!cient to characterize line graphs (Biggs, 1996, p. 18). The state-of-the-art knowledge about line graphs is reviewed by Cvetkovi´c et al. (2004), who treat the characterization of line graphs in detail. A graph is a line graph if it satisfies certain conditions. Referring for proofs to Cvetkovi´c et al. (1995, 2004), we mention here only: Theorem 3 (Krausz) A graph is a line graph if and only if its set of links can be partitioned into “non-trivial” cliques such that (i) two cliques have at most one node in common and (ii) each node belongs to at most two cliques. Theorem 4 (Van Rooij and Wilf ) A graph is a line graph if and only if (i) it does not contain the star N1>3 as an induced subgraph and (ii) the remaining (or
2.1 Graph related matrices
21
opposite) nodes in any two triangles with a common link must be adjacent and each of such triangles must be connected to at least one other node in the graph by an odd number of links.
2.1.3 The quotient graph 10. Permutation matrix S . Consider the set N = {q1 > q2 > = = = > qQ } of nodes of J, where qm is the label of node m. The most straightforward way is the labeling qm = m. Suppose that the nodes in J are relabeled. This means that there is a permutation, often denoted by , that rearranges the node identifiers qm as ql = (qm ). The corresponding permutation matrix S has element slm = 1 if ql = (qm ), and slm = 0 otherwise. For example, the set of nodes {1> 2> 3> 4} is permuted to the set {2> 4> 1> 3} by the permutation matrix 6 5 0 1 0 0 9 0 0 0 1 : : S =9 7 1 0 0 0 8 0 0 1 0 If the vector y = (1> 2> 3> 4), then S y = z, where the permuted vector z = (2> 4> 1> 3). Next, S z = } = (4> 3> 2> 1), then S } = | = (3> 1> 4> 2), and S | = y. Thus, S 4 y = y. This observation holds in general, S Q y = y for each Q × Q permutation matrix S : each node can be relabeled to one of the {q1 > q2 > = = = > qQ } possible labels and the permutation matrix maps each time a label qm $ (qm ) = ql , where, generally, ql 6= qm , else certain elements are not permuted3 . After Q relabelings, we arrive again at the initial labeling. The definition (8.77) of the determinant shows that det S = ±1, because in each row there is precisely one non-zero element equal to 1. Another example of a permutation matrix is the unit-shift relabeling transformation in Section 5.2.1. 11. A permutation matrix S is an orthogonal matrix. Since a permutation matrix S relabels a vector y to a vector z = S y, both vectors y and z contain the same components, but in a dierent order (provided S 6= L), such that their norms (art. 161) are equal, kyk = kzk. Using the Euclidean norm k{k22 = {W {, the equality yW y = zW z implies that S W S = L, such that S is an orthogonal matrix (art. 151). 12. If J1 and J2 are two directed graphs on the same set of nodes, then they are called isomorphic if and only if there is a permutation matrix S such that S W DJ1 S = DJ2 . Since permutation matrices are orthogonal, S 1 = S W , the spectra of J1 and J2 are identical (art. 151) : the spectrum is an invariant of the isomorphism class of a graph. 3
The special permutation S = L does not, in fact, relabel nodes.
22
Algebraic graph theory
13. Automorphism. We investigate the eect of a permutation of the nodal set N of a graph on the structure of the adjacency matrix D. Suppose that ql = (qm ) and qn = (qo ), then we have with the definition of S in art. 10, (S D)lo =
Q X
slp dpo = dmo
p=1
(DS )lo =
Q X
dlp spo = dln
p=1
In order for D and S to commute, i.e., S D = DS , we observe that, between each node pair (qm > qo ) and its permutation ( (qm ) > (qo )) there must be a link such that dmo = 1 = dln . An automorphism of a graph is a permutation of the nodal set N such that (ql > qm ) is a link of J if and only if ( (ql ) > (qm )) is a link of J. Hence, if the permutation is an automorphism, then D and S commute. The consequences for the spectrum of the adjacency matrix D are interesting. Suppose that { is an eigenvector of D belonging to the eigenvalue , then DS { = S D{ = S { = S { which implies that S { is also an eigenvector of D belonging to eigenvalue . If { and S { are linearly independent, then cannot be a simple eigenvalue. Thus, an automorphism produces multiple eigenvectors belonging to a same eigenvalue. 14. Partitions. A generalization of a permutation is a partition that separates the nodal set N of a graph in disjoint, non-empty subsets of N , whose union is N . The n 5 [1> Q ] disjoint, non-empty subsets generated by a partition are sometimes called cells, and denoted by {F1 > F2 > = = = > Fn }. If n = Q , the partition reduces to a permutation. We also denote a partition by . Let {F1 > F2 > = = = > Fn } be a partition of the set N = {1> 2> = = = > Q } of nodes and let D be a symmetric matrix, that is partitioned as 6 5 D1>1 · · · D1>n 9 .. : D = 7 ... . 8 Dn>1
···
Dn>n
where the block matrix Dl>m is the submatrix of D formed by the rows in Fl and the columns in Fm . For example, the partition F1 = {1> 3}, F2 = {2> 4> 6} and F3 = {5} of the nodes in Fig. 2.1 leads to the partitioned adjacency matrix 5 ¸ ¸ 6 ¸ 0 1 0 1 0 1 : 9 9 5 1 0 6 5 1 1 0 6 5 0 6 : : 9 1 0 0 1 1 1 : 9 : D = 9 7 9 0 1 8 7 0 0 0 8 7 1 8 : : 9 8 7 1 £ 1 0 ¤ £ 1 0 0 ¤ [0] 0 0 1 1 1
2.1 Graph related matrices
23
The characteristic matrix V of the partition, also called the community matrix V, is the Q × n matrix whose columns are the vectors Fn labeled in accordance with D. Thus, in the example, the matrix V corresponding to the partition F1 = {1> 3}, F2 = {2> 4> 6} and F3 = {5} is 6 5 1 0 0 9 1 0 0 : 5 6 : 9 x2 0 0 : 9 0 1 0 : 7 9 V=9 0 x3 0 8 := 9 0 1 0 : : 9 0 0 x1 7 0 1 0 8 0 0 1 where xm is the all one vector of dimension m. Clearly, V W V = diag(2> 3> 1). In general, V W V = diag(|F1 | > |F2 | > = = = > |Fn |), where |Fn | equals the number of elements in the set Fn . Each row of V only contains one non-zero element, which follows from the definition of a partition: a node can only belong to one cell (or community) of the partition and the union of all cells is again the complete set N of nodes. Thus, the elements of the Q × n community matrix V are ½ 1 if node l belongs to the set (or community) Fm Vlm = 0 otherwise ¢ ¡ and, the columns of V are orthogonal and trace V W V = Q . 15. Quotient matrix. The quotient matrix corresponding to the partition specified by {F1 > F2 > = = = > Fn } is defined as the n × n matrix ¡ ¢1 W V ( D) V (2.11) D = V W V ³ ´ ¡ ¢1 where V W V = diag |F11 | > |F12 | > = = = > |F1n | . The quotient matrix of the matrix D of the example in art. 14 is 6 5 1 2 0 D = 7 4 2 1 8 3
3
0
3
0
We can verify that (D )lm denotes the average row sum of the block matrix ( D)l>m . An example of the quotient matrix T of a Laplacian T is given in Section 5.11. If the row sum of each block matrix Dl>m is constant, then the partition is called equitable (or regular). In that case, Dl>m x = ( D)l>m x or DV = VD . Also, a partition is equitable if, for any l and m, the number of neighbors that a node in Fl has in the cell Fm does not depend on the choice of a node in Fl . For example, consider a node y in the Petersen graph shown in Fig. 2.3 and construct the three cell partitions as F1 = {y}, F2 is the set of the neighbors of y and F3 is the set of nodes two hops away from y. The number of neighbors of y in F2 is three and zero in F3 , while the number of
24
Algebraic graph theory
Fig. 2.3. The Petersen graph.
neighbors of a node in F2 with F3 is two such 5 0 3 D = 7 1 0 0 1
that 6 0 2 8 2
A distance partition with respect to node y is the partition of N into the sets of nodes in J at distance u from a node y. A distance partition is, in general, not equitable. If y is an eigenvector of D belonging to the eigenvalue , then Vy is an eigenvector of D belonging to the same eigenvalue . Indeed, left-multiplication of the eigenvalue equation D y = y by V yields Vy = VD y = ( D) Vy This property makes equitable partitions quite powerful. For example, the adjacency matrix of the complete bipartite graph Np>q (see Section 5.7) has an equitable partition with n = 2. The corresponding quotient ¸ s 0 p whose eigenvalues are ± pq, which are the non-zero matrix is D = q 0 eigenvalues of Np>q . The quotient matrix of the complete multi-partite graph is derived in Section 5.9. The quotient graph of an equitable partition, denoted by J , is the directed graph with the cells of the partition as its nodes and with (D )lm links going from cell/node Fl to node Fm . Thus, (D )lm equals the number of links that join a node in the cell Fl to the nodes in cell Fm . In general, the quotient graph contains multiple links and self-loops. The subgraph induced by each cell in an equitable partition is necessarily a regular graph because each node in cell Fl has the same number of neighbors in cell Fm .
2.2 Walks and paths
25
16. Trees. We consider an application of equitable partitions to trees. A tree W is centrally symmetric with center x if and only if there is an automorphism of W , which fixes x and which maps { to |, where { and | are any two nodes in W at the same distance from x. Lemma 1 A tree is centrally symmetric with respect to node x if and only if the distance partition is equitable. ¤
Proof: see Godsil (1993).
Lemma 2 Any tree with maximum degree gmax is a subgraph of a centrally symmetric tree Wgmax with property that all nodes of Wgmax have degree 1 or gmax . ¤
Proof: see Godsil (1993).
The tree Wgmax is completely determined once the radius, the distance from the center to an end-node, is known. The quotient matrix D of the adjacency matrix of Wgmax corresponding to the distance partition is 6 5 0 ··· 0 0 gmax : 9 1 0 gmax 1 : 9 : 9 .. D = 9 : . : 9 7 1 0 gmax 1 8 1
0
A similarity transform does not alter the eigenvalues (art. 142). If μ½³p ´l1 ¾ ¶ K = diag gmax 1 l
f = KD K 1 , with the same dimensions as D , then D 5 s gmax 0 ··· 0 0 gmax 1 s s 9 0 gmax 1 9 gmax 1 9 .. f = 9 D . 9 s s 9 7 gmax 1 0 gmax 1 s gmax 1 0
6 : : : : : : 8
These results are used in art. 63.
2.2 Walks and paths 17. A walk of length n from node l to node m is a succession of n arcs of the form (q0 $ q1 )(q1 $ q2 ) · · · (qn1 $ qn ) where q0 = l and qn = m. A path is a walk in which all vertices are dierent, i.e., qo 6= qp for all 0 o 6= p n. A closed walk of length n, also called a cycle of length n, is a walk that starts in node l and returns, after n hops, to that same node l.
26
Algebraic graph theory
Lemma¡3 The ¢ number of walks of length n from node l to node m is equal to the element Dn lm . Proof (by induction): For n = 1, the number of walks of length 1 between state l and m equals the number of direct links between l and m, which is by definition the element dlm in the adjacency matrix D. Suppose the lemma holds for n 1. A walk of length n consists of a walk of length n 1 from l to some vertex u which is adjacent to m.¡ By the ¢ induction hypothesis, the number of walks of length n 1 from l to u is Dn1 lu and the number of walks with length 1 from u to m equals dum .¢ The total of walks from l to m with length n then equals ¢ ¡ nnumber PQ ¡ n1 D d = D (by the rules of matrix multiplication). ¤ um u=1 lu lm Explicitly, Q X Q Q X X ¡ n¢ D lm = ··· dlu1 du1 u2 · · · dun2 un1 dun1 m u1 =1 u2 =1
(2.12)
un1 =1
18. The number of paths with n hops between node l and node m is, for n A 1 and Q A 2, [n (l> m; Q ) =
X
X
u1 6={l>m} u2 6={l>u1 >m}
X
···
dlu1 du1 u2 · · · dun1 m
un1 6={l>u1 >===>un2 >m}
while the number of paths with n = 1 hop between the node pair (l> m) is [1 (l> m; Q ) = dlm Symmetry of the adjacency matrix D implies that [n (l> m; Q ) = [n (m> l; Q ). The definition of a path restricts the first index u1 to Q 2 possible values, the second u2 to Q 3, etc., such that the maximum number of n hop paths, which is attained in the complete graph NQ , where dlm = 1 for each link (l> m), equals n1 Y
(Q 1 o) =
o=1
(Q 2)! (Q n 1)!
whereas the total possible number of walks follows from (2.12) as Q n1 . The total number of paths PQ between two nodes in the complete graph is PQ =
Q 1 X m=1
Q2 X 1 (Q 2)! = (Q 2)! (Q m 1)! n!
= (Q 2)!h U
n=0
2.2 Walks and paths
27
where U = (Q 2)!
4 X m=Q 1
X (Q 2)! 1 = m! m=0 (Q 1 + m)! 4
1 1 1 + + + ··· = Q 1 (Q 1)Q (Q 1)Q (Q + 1) ¶m 4 μ X 1 1 ? = Q 1 Q 2 m=1 implying that for Q 3, U ? 1. But PQ is an integer. Hence, the total number of paths in NQ is exactly equal to PQ = [h(Q 2)!]
(2.13)
where h = 2.718 281=== and [{] denotes the largest integer smaller than or equal to {. Since any graph is a subgraph of the complete graph, the maximum total number of paths between two nodes in any graph is upper bounded by [h(Q 2)!]. 19. Diameter of a graph. A graph J is connected if there exists a walk between each pair of nodes in J. Lemma 3 shows ¡that¢ connectivity is equivalent to the existence of some integer n A 0 for which Dn lm 6= 0 for each nodal pair (l> m). ¡ ¢ The lowest integer n for which Dn lm 6= 0 for each pair (l> m) of nodes is called the diameter of the graph J. The diameter thus equals the length of the longest shortest hop path in J. 20. A shortest path. To each link ho = l $ m 5 L from node l 5 N to node m 5 N in the network, we assign a link weight z(ho ) = zlm , a non-negative real number, which quantifies a property of that link such as the delay incurred or energy needed when traveling over that link, the distance, the capacity, monetary cost, etc. The set of all link weights is called the link weight structure of J. We consider only P additive link weights such that the weight of a path S is z(S ) = ho 5S z(ho ), i.e., z(S ) equals the sum of the weights of the constituent links of S . The shortest path SD$E from D to E is the path with minimal weight, thus, z (SD$E ) z (SD$E ) for all SD$E . If all link weights are equal to zlm = 1, shortest paths are shortest hop paths and z (SD$E ) is also called the distance between nodes D and E. There exist many routing algorithms to compute shortest paths in networks. The most important of these routing algorithms are explained, for example, in Van Mieghem (2006a) and Cormen et al. (1991).
3 Eigenvalues of the adjacency matrix
Only general results of the eigenvalue spectrum of a graph J are treated. For special types of graphs, there exists a wealth of additional, but specific properties of the eigenvalues.
3.1 General properties 21. Since D is a real symmetric matrix, art. 151 shows that D has Q real eigenvalues, which we order as Q Q 1 · · · 1 . Apart from a similarity transform (art. 142), the set of eigenvalues with corresponding eigenvectors is unique. A similarity transform consists of a relabeling of the nodes in the graph that obviously does not alter the structure of the graph but merely expresses the eigenvectors in a dierent base. The classical Perron-Frobenius Theorem 38 in art. 168 for non-negative square matrices states that 1 is a simple and non-negative root of the characteristic polynomial in (8.3) possessing the only eigenvector of D with non-negative components. The largest eigenvalue 1 is also called the spectral radius of the graph. 22. Since the characteristic polynomial fD () = det (D L), defined in art. 138, Q has integer coe!cients and fq = (1) , it follows from art. 197 that the only rational zeros of fD (), i.e., zeros belonging to Q, are integers. This property also holds for the Laplacian matrix T. For example, 34 is never an eigenvalue of D nor T. 23. Gerschgorin’s Theorem 36 applied to the adjacency matrix states that any eigenvalue of D lies in the interval [gmax > gmax ]. Hence, 1 Q 1 and this maximum is attained in the complete graph (see Section 5.1). 24. Theorem 63, with p = 1 and using (3.2), indicates that q ¸ all the eigenvalues of q 2(Q 1) 2(Q 1) D are contained in the interval O> O . Q Q 25. Since dll = 0, we have that trace(D) = 0. From (8.7), the coe!cient fQ 1 of 29
30
Eigenvalues of the adjacency matrix
the characteristic polynomial fD () is (1)Q1 fQ1 =
Q X
n = 0
(3.1)
n=1
26. Applying the Newton identities (9.3) to the characteristic polynomial (8.3) and (8.5) of the adjacency matrix with }n = n , dn = (1)Q fn and fQ 1 = 0 (from (3.1)) yields for the first few values, fQ 2 =
Q 1 X 2 n 2 n=1
3n 3 n=1 3Ã 4 !2 Q Q X 1C X 2 = n 2 4n D 8
fQ 3 =
fQ 4
Q 1X
n=1
n=1
P 27. From (8.4), the coe!cient of the characteristic polynomial fQ2 = all P2 . Each principal¸minor P2 of the adjacency matrix D has a principal submatrix of the 0 { with {> | 5 [0> 1]. A minor P2 is non-zero if and only if { = | = 1, form | 0 in which case P2 = 1. For each set of adjacent nodes, there exists a non-zero minor, which implies that fQ 2 = O The Newton identities in art. 26 show that the number of links O equals Q 1 X 2 n O= 2
(3.2)
n=1
PQ Since the mean H [] = Q1 n=1 n = 0 (art. 25), the variance of the adjacency eigenvalues equals, invoking the basic law of the degree (2.3), Var [] =
Q 1 X 2 2O = H [G] n = Q Q n=1
Especially in order to understand the density function of the adjacency eigenvalues (for example, in Section 7), this stochastic interpretation is helpful. 28. Each principal submatrix P3×3 of the 5 0 P3×3 = 7 { }
adjacency matrix D is of the form 6 { } 0 | 8 |
0
and the corresponding minor P3 = det P3×3 = 2{|} is only non-zero for { = | =
3.1 General properties
31
} = 1. That form of P3×3 corresponds with a subgraph of three nodes that are fully connected. Hence, fQ3 = 2× the number of triangles NJ in J. From art. 26, it follows that the number of triangles in J is 1X 3 n 6 Q
NJ =
(3.3)
n=1
29. In general, from (8.4) and by identifying the structure of a minor Pn of D, any coe!cient fQ n can be expressed in terms of graph characteristics, X (1)Q fQ n = (1)f|fohv(G) (3.4) G5Jn
where Jn is the set of all subgraphs of J with exactly n nodes and f|fohv (G) is the number of cycles in a subgraph G 5 Jn . The minor Pn is a determinant of the Pn×n submatrix of D and defined (see art. 187) as X Pn = (1)(s) d1s1 d2s2 · · · dnsn s
where the sum is over all n! permutations s = (s1 > s2 > = = = > sn ) of (1> 2> = = = > n) and (s) is the parity of s, i.e., the number of interchanges of (1> 2> = = = > n) to obtain (s1 > s2 > = = = > sn ). Only if all the links (1> s1 ) > (2> s2 ) > = = = > (n> sn ) are contained in J, d1s1 d2s2 = = = dnsn is non-zero. Since dmm = 0, the sequence of contributing links (1> s1 ) > (2> s2 ) > = = = > (n> sn ) is a set of disjoint cycles such that each node in Jn belongs to exactly one of these cycles and (s) depends on the number of those disjoint cycles. Now, Pn is¡constructed from a specific set G 5 Jn of n out of Q nodes and ¢ in total there are Q such sets in Jn . Combining all contributions leads to the n expression (3.4). Harary (1962) discusses the determinant det D of a directed graph, from which another expression than (3.4) for the coe!cients fn of the characteristic polynomial fD () can be derived. An elementary subgraph of J on n nodes is a graph in which each component is either a link between two distinct nodes or a cycle. Here, a cycle is thus of at least length 3, possessing at least three nodes or links. Harary observes that, in the determinant of the adjacency matrix D (or in each of its minors) of a directed graph, each directed cycle of even (odd) length contributes negatively (positively) to det D. Let hf denote the number of even components in an elementary subgraph, i.e. containing an even number of nodes. Each cycle in an undirected graph corresponds to the two directions in its directed companion. Harary (1962) shows that the determinant of the adjacency matrix of an elementary subgraph H equals Y Y det D (H) = (1)hf (H) 2|f(H)| d2n dp dn 5h(H)
dp 5f(H)
where f (H) is the set of components that are cycles in H and h (H) is the set of components that are simple links in H. Finally, if Kn denotes the set of all
32
Eigenvalues of the adjacency matrix
elementary subgraphs of J with n nodes, then the coe!cient of the characteristic polynomial fD () can be written as X h (H) |f(H)| (1)Q fQ n = (1) f 2 H5Kn
30. Since D is a symmetric 0-1 matrix, we observe that using (2.2), Q Q Q X X X ¡ 2¢ D ll = dln dnl = d2ln = dln = gl n=1
n=1
n=1
Hence, with (3.2) and (8.7), the basic law for the degree (2.3) is expressed as trace(D2 ) =
Q X
2n =
n=1
Q X
gn = 2O
(3.5)
n=1
Furthermore, Q Q Q Q Q X Q Q Q X X X X X X X ¡ 2¢ D lm = dln dnm = dnl dnm l=1 m=1;m6=l
=
l=1 m=1;m6=l n=1
n=1 l=1
Q Q X X
Q X
dnl (gn dnl ) =
n=1 l=1
Ã
n=1
gn
m=1;m6=l Q X
dnl
l=1
Q X
! dnl
l=1
or Q Q X X ¡
D2
¢ lm
=
l=1 m=1;m6=l
Q X
gn (gn 1)
(3.6)
n=1
¡ ¢ PQ PQ Lemma 3 states that l=1 m=1;m6=l D2 lm equals twice the total number of twohop walks with dierent source and destination nodes. In other words, the total number of connected triplets of nodes in J equals half (3.6). Art. 8 further shows that Q Q μ ¶ Q X X X ¡ 2¢ gl D lm = 2 = 2Oo(J) 2 l=1 l=1 m=1;m6=l
which means that the number of links in the line graph o (J) of the graph J equals the number of connected triplets of nodes in J. 31. Applying the Hadamard inequality (8.93) for the determinant of a matrix yields, with (2.2), ÃQ ! 12 ÃQ ! 12 Q Q Q Y X Y X Y p |det D| d2ml = dml = gm m=1
l=1
m=1
l=1
m=1
Hence, with (8.6), (det D)2 =
Q Y n=1
2n
Q Y
gm
m=1
(3.7)
3.2 The number of walks
33
32. Art. 158 relates the diagonal elements of a symmetric matrix to its eigenvalues. Since dmm = 0, the matrix equation (8.35) becomes \ = 0, where the vector =¤ £ W (1 > 2 > = = = > Q ) and where the¡ non-negative matrix \ = |Q | 1 |2 · · · ¢ 2 2 2 consists of column vectors |m = {1m > {2m > = = = > {Q m , where {nm is the m-th component of the n-th eigenvector of D belonging to n . Geometrically, \ = 0 means that the vector is orthogonal to all Q vectors |m and, in order to have a non-zero solution for , there must hold that det \ = 0. This means, that the matrix \ has a zero eigenvalue, while all other eigenvalues of \ lie, as shown in art. 158, within the unit circle and the largest eigenvalue is precisely equal to 1. In addition, det \ = 0 implies that the set of vectors |1 > |2 > = = = > |Q is linearly dependent! Since the n-th row of \ equals the vector }n consisting of the squared components of the n-th eigenvector {n , the property det \ = det \ W = 0 also implies that the vectors }1 > }2 > = = = > }Q are linearly dependent. ¡ ¢ Since D2 mm = gm , another instance of (8.36) gives \ W 2 = g ¢ ¡ where the vector 2 = 21 > 22 > = = = > 2Q and g = (g1 > g2 > = = = > gQ ) is the degree vector. Since \ x = x (art. 158), left-multiplying with x yields xW 2 = 2O, which is (3.5).
3.2 The number of walks 33. The total number Qn of walks of length n in a graph follows from Lemma 3 as Qn =
Q X Q X (Dn )lm = xW Dn x
(3.8)
l=1 m=1
For example, Q0 = Q> Q1 = 2O. Invoking (2.4) and DW = D, we can write Qn = xW DW Dn2 Dx = gW Dn2 g For example, if n = 2, we obtain Q2 = gW g, or Q2 =
Q X
³ ´ g2n = Q (H [G])2 + Var [G]
(3.9)
n=1
The number of walks {Q0 > Q1 > = = = > Q10 } in the graph of Fig. 2.1 ignoring directions and up to n = 10 is {6> 18> 56> 174> 542> 1688> 5258> 16378> 51016> 158910> 494990}. Since the adjacency matrix D is symmetric, art. 156 provides us with Dn =
Q X
nq {q {Wq
(3.10)
q=1
such that total number Qn = xW Dn x of walks of length n is expressed in terms of
34
Eigenvalues of the adjacency matrix
the eigenvalues of D as Qn =
Q X ¡ W ¢2 n {q x q
(3.11)
q=1
PQ where {Wq x = m=1 ({q )m is the sum of the components of the eigenvector {q . When the (normalized) eigenvector {1 = sxQ as in regular graphs (art. 41) where 1 = u, the number of all walks with n hops equals Qn = Q un . Geometrically, the scalar P product {Wq x = Q m=1 ({q )m is the projection of the eigenvector {q onto the vector x, s (3.12) {Wq x = k{q k2 kxk2 cos q = Q cos q where q is the angle between the eigenvector {q and the all-one vector x. The total number Qn of walks of length n, written in terms of the “graph angles” as coined by Cvetkovi´c et al. (1997), is Qn = Q
Q X
nq cos2 q
(3.13)
q=1
¡ ¢ Since Qn = xW Dp Dnp x = (Dp x)W Dnp x , the Cauchy-Schwarz inequality (8.41) shows that ¯ ¯ ³ ´ ³¡ ¢W ¡ np ¢´ ¯ p W ¡ np ¢¯2 W Dnp x D x ¯ (Dp x) (Dp x) x ¯(D x) D from which we obtain, for integers n 0, the inequality ´ ¡ ¢³ Qn2 xW D2p x xW D2(np) x
(3.14)
valid for any number p, provided Dp exists and Dp is a real matrix. Equality only holds for regular graphs. If 2p is an integer, we have Qn2 Q2p Q2n2p . In particular for p = 0, there holds that Qn2 Q Q2n . When 2p = 1, we 2 1@2 would erroneously = ³p ´deduce that Qn (2O) Q2n1 , which is wrong because D W n (D) [ is a not a real matrix (as is required for the application of the [ diag Cauchy-Schwarz inequality), because at least one eigenvalue Q (D) is negative. 34. The generating function QJ (}). The generating function of the total number of walks in a graph J is defined as QJ (}) =
4 X
Qn } n
(3.15)
n=0
The two dierent expressions in art. 33 result in two dierent expressions for QJ (}). First, substituting the definition (3.8) into (3.15) yields Ã4 ! X 1 QJ (}) = xW Dn } n x = xW (L }D) x (3.16) n=0
3.2 The number of walks
35
where |}| ? 11 in order for the infinite series to convergence (art. 149). Since D is symmetric, there holds for any analytic function i (}) (possessing a power series expansion around some point) that i (D) = (i (D))W . Thus, we have that ° °2 ³ ´W 1 1 1 ° ° (L }D) 2 x = °(L }D) 2 x° xW (L }D)1 x = xW (L }D) 2 2
which shows that
° °2 1 ° ° QJ (}) = °(L }D) 2 x° 0 2
for all real } obeying |}| ? 11 . The zeros of QJ (}) are simple and lie in between two consecutive eigenvalues of D as follows from art. 180. Second, invoking (3.11) gives, for |}| ? 11 , QJ (}) =
Q X ¡
¢2 {Wq x
q=1
4 X
nq } n
n=0
Q ¡ W ¢2 X {q x = 1 q } q=1
(3.17)
Since QJ (0) = Q0 = Q , we have Q=
Q X ¡ W ¢2 {q x
(3.18)
q=1
and, with (3.13), Q X
cos2 q = 1
q=1
For regular graphs (art. 41), where {1 = sxQ is the eigenvector belonging to 1 = u, the generating function (3.17) of the total number of walks simplifies to Qregular
graph
(}) =
Q 1 u}
(3.19)
Cvetkovi´c et al. (1995, p. 45) have found an elegant formula for QJ (}) by rewrit1 ing xW (L }D) x using (8.81). Indeed, for n = 1 in (8.81) and FQ ×1 = {x and GQ ×1 = x, we obtain with M = x=xW , ¢ ¡ ¢ ¡ det (D + }M) = det D det 1 + }xW D1 x = 1 + }xW D1 x det D Replacing D $ L }D results in xW (L }D)
1
x=
1 }
μ
¶ det (L + } (M D)) 1 det (L }D)
The right-hand side can be written in terms of the complement Df = M L D as ! Ã ¡ f }+1 ¢ 1 1 Q det D + } L W ¡ ¢ 1 x (L }D) x = (1) } det D }1 L
36
Eigenvalues of the adjacency matrix
Finally, using the characteristic polynomial of a matrix D, fD (}) = det (D }L), we arrive at Cvetkovic’s formula, for |}| ? 11 , ! Ã ¡ 1 ¢ 1 Q fDf } 1 ¡ ¢ 1 (3.20) QJ (}) = (1) } fD }1 which shows that }QJ (}) + 1 is a ratio of two real polynomials, both with real zeros and of degree at most Q . The right-hand side of (3.16), (3.17) and (3.20) can serve as analytic continuations of QJ (}) for |}| 11 . 35. The total number of walks Qn and the sum of degree powers. We will prove the inequality Qn
Q X
gnm
(3.21)
m=1
due to Fiol and Garriga (2009). Equality in (3.21) for all n 0 is only achieved for regular graphs, because Qn;regular graph = Q un (art. 33). For n 2, equality P PQ 0 in (3.21) holds in general, because Q0 = Q = Q m=1 gm , Q1 = 2O = m=1 gm and P 2 g . For n A 2, the total number Q of walks of length n is Q2 = gW g = Q n m=1 m Qn = xW DW Dn2 Dx = gW Dn2 g =
Q X Q X
¡ ¢ gl Dn2 lm gm
l=1 m=1
=
Q X
¡ n2 ¢ 2 D g +2 ll l
l=1
Q X
Q X
¡ ¢ gl Dn2 lm gm
l=1 m=l+1
where the last sum holds by symmetry of D = DW . From 0 (d e)2 = d2 +e2 2de, we see that d2 + e2 2de such that Q Q X X
2
Q Q X X ¡ ¢ ¡ n2 ¢ © 2 ª D gl + g2m gl Dn2 lm gm lm
l=1 m=l+1
l=1 m=l+1
and Qn
Q Q X Q X Q Q X ¡ n2 ¢ 2 X ¡ n2 ¢ © 2 ª X ¡ n2 ¢ 2 2 D D g = D g + + g g l m ll l lm lm m l=1 W
l=1 m=l+1
l=1 m=1
n2 2
=x D
g
where the vector gm = argument
³ ´ gm1 > gm2 > = = = > gmQ . This derivation suggests the induction
Qn xW Dnp gp xW Dnp1 gp+1
(3.22)
which has been demonstrated already for p = 0> 1 and 2. Assume now that it holds
3.2 The number of walks
37
for p = 0, then the induction inequality (3.22) is proved when we can show that it also holds for p = + 1. Using Dx = g in (2.4) and D = DW , xW Dn g = xW DW Dn1 g = gW Dn1 g =
Q X Q X
¡ ¢ gl Dn1 lm gm
l=1 m=1
=
Q X
¡ n1 ¢ +1 D g + lm l
l=1
Q X
Q X
¡ n1 ¢ ¡ ¢ D gl gm + gm gl lm
l=1 m=l+1
Fiol and Garriga (2009) now cleverly use the inequality for any positive numbers d and e, ¢ ¡ dn e + den = dn+1 + en+1 dn en (d e) dn+1 + en+1 with equality if and only if d = e, and obtain xW Dn g
Q Q X Q X ¡ n1 ¢ +1 X ¡ n1 ¢ ¡ +1 ¢ D D gm + g+1 g + l l lm lm l=1
=
Q X Q X ¡
l=1 m=l+1
Dn1
¢ lm
g+1 = xW Dn(+1) g+1 m
l=1 m=1
which establishes the induction inequality (3.22) and completes the proof of (3.21). By using the fundamental form of the Laplacian (4.11) in art. 77, applied to { = g, X 2 gW Tg = (go+ go ) W
W
and g Tg = g ( D) g = Q X
g3m Q3 =
m=1
PQ
3 m=1 gm
X o5L
o5L
gW Dg, we find that 1 XX 2 (gl gm ) dlm 2 l=1 m=1 Q
2
(go+ go ) =
Q
(3.23)
where the right-hand side sums, over all links o in the graph, the square of the dierence between the degrees at both side of the link o. We will see in Section 7.5 how this expression can be related to the linear correlation coe!cient of the degrees in a graph and to the (dis)assortative property of a graph. 36. The number of closed walks Zn of length n in graph J is defined in art. 17; Lemma 3 and art. 144 show that Zn =
Q Q X ¡ ¢ X (Dn )mm = trace Dn = nm m=1
(3.24)
m=1
Since the mean H [] = 0 (art. 25), the definition (3.24) demonstrates that all centered moments of the adjacency eigenvalues are non-negative and equal to h i Z n H ( H [])n = Q
38
Eigenvalues of the adjacency matrix
Hence, the centered n-th moment is equal to the number of a closed walks of length n per node. The special case for n = 2 is Var[] = 2O Q , which is deduced in art. 27. When n = 3, (3.3) indicates that h i 6N J H ( H [])3 = Q The skewness v , that measures the lack of symmetry of the distribution around the mean, is defined as the normalized third moment, h i H ( H [])3 3NJ v = ³ h i´3@2 = p 2 O H [G] H ( H []) Since a tree does not have triangles, NJ = 0, the minimum possible skewness, v = 0, in the distribution of adjacency eigenvalues is achieved for a tree. In Section 5.8, we will indeed show that only the adjacency spectrum of a tree is symmetric around the mean (or origin = 0). The number of closed walks Zn of length n in graph J has a nice generating function, which is derived from Jacobi’s general identity (art. 193). Let F = }D in (8.89), trace log (L }D) = log det (L }D) and expand log (L }D) =
4 X (}D)n n=1
n
This Taylor series converges (art. 149) provided |}| ? respect to }, we obtain
1 1 .
After dierentiation with
¡ ¢ g 1X log det (L }D) trace Dn } n = } g} 4
n=1
¡ ¢ With Zn = trace Dn and Z0 = Q , the generating function of the number of closed walks Zn in J and convergent for |}| ? 11 is ZJ (}) =
4 X
Zn } n = Q + }
n=0
g log det (L }D) g}
(3.25)
Substitution of the last equality in (3.24) into the generating function (3.25) yields, for |}| ? 11 , ZJ (}) =
4 Q X X m=1 n=0
nm } n =
Q X m=1
1 1 m }
In terms of the characteristic polynomial fD () =
PQ
n n=0 fn
(3.26) of D, which is
3.2 The number of walks ¡ ¢ fD () = det (D L) = ()Q det L 1 D , we have
39
Q ¡ ¢ X det (L }D) = (})Q fD } 1 = (1)Q fQ n } n n=0
with (1)Q fQ = 1. Then, we deduce from (3.25) that Ã4 ! Q X X }n Q n (1) fQn } = exp Zn n n=0
n=1
from which, by Taylor’s theorem, Q
(1) fQ n
Ã4 !¯ ¯ X Zn 1 gn n ¯ } ¯ = exp n ¯ n! g} n n=1
}=0
This relation is equivalent to the Newton identities (art. 26). In fact, by applying our characteristic coe!cients defined in Van Mieghem (2007), the above derivatives can be explicitly computed for any finite n. The result leads precisely to that in art. 26. 37. The generating function of the number of closed walks of length n that start and terminate at node m (art. 17), is defined as ZJ (}; m) =
4 X ¡ n¢ n D mm }
(3.27)
n=0
Substituting the m-th diagonal element of (3.10) into (3.27) yields, for |}| ? ¡ ¢ 4 Q Q X X X {q {Wq mm ¡ ¢ {q {Wq mm nq } n = ZJ (}; m) = 1 q } q=1 q=1
1 1 ,
n=0
³ ´2 ¢ ¡ Art. 157 indicates that {n {Wn mm = ({n )m , such that ZJ (}; m) =
³ ´2 Q ({q )m X q=1
1 q }
(3.28)
PQ Clearly, by definition, we have that ZJ (}) = m=1 ZJ (}; m), while (3.26) and ´2 PQ ³ (3.28) indicate that m=1 ({q )m = 1, which confirms the normalization {Wq {q = 1 of the eigenvector {q . Combining (8.65) and (8.66) in art. 178 yields ¡ ¢ ¢ ¡ Q X {q {Wq mm det }L D\{m} = det (}L D) } q q=1 where D\{m} is the (Q 1)×(Q 1) adjacency matrix obtained from D by deleting the m-th row and column. Thus, D\{m} is the adjacency matrix of the subgraph
40
Eigenvalues of the adjacency matrix
J\ {m} of J obtained from the graph J by deleting node m and all its incident links. Hence, ¢ ¡ ¶ μ det }L D\{m} 1 1 = ZJ ;m det (}L D) } } and written in terms of the characteristic polynomial of a matrix D, fD (}) = det (D }L), we obtain ¡ ¢ fD\{m} }1 ¡ ¢ ZJ (}; m) = }fD }1 The relation between the characteristic polynomials fD\{m} (}) and fD (}) is further studied in art. 60. 38. Relations between Qn and Zn . Let p be the maximizer of {Wn x over all 1 n Q eigenvectors such that {Wp x {Wn x for any 1 n 6= p Q . Geometrically, the “graph angle” representation in (3.12), {Wn sxQ = cos (n ), reflects that all orthogonal eigenvectors {1 > {2 > = = = > {Q start at the origin and end on an Q -dimensional unit sphere centered at the origin. The graph angle between {n and sx is largest for {1 , by the Perron-Frobenius Theorem 38 in art. 168, because Q {1 and sxQ lie in the same Q -dimensional “quadrant” as both their components are non-negative. Any other vector {n must be orthogonal to {1 , implying that {n cannot lie in the “opposite” Q -dimensional “quadrant”, where all components or coordinates are negative, and in which the resulting cos (n ) also can be large. Another, though less transparent, argument follows from the Cauchy identity (8.86), Q Q ´2 ¡ W ¢2 1 XX³ x {n = Q ({n )m ({n )o 2 m=1 o=1
=Q
m1 ³ Q X X
´2 ({n )m ({n )o
m=1 o=1
¢2 ¡ which illustrates that the maximizer over all xW {n has minimum dierence between its components. Thus, it is the eigenvector {p that is as close as possible to the vector s1Q x with all components exactly the same. In conclusion, p = 1 and {W1 x A {Wn x for all 1 ? n Q . ¯Art. ¯162 further demonstrates that {W1 x 1, PQ PQ ¯ ¯ because {W1 x = m=1 ({1 )m = m=1 ¯({1 )m ¯ = k{1 k1 and k{1 k1 k{1 k2 = 1. ¡ ¢2 ¡ ¢2 Likewise, let t be the index that minimizes {Wn x {Wt x for any 1 n 6= t Q . Recall that {Wt x = 0 for a regular graph. Then, (3.11) is lower and upper bounded as Q Q Q X ¡ W ¢2 X ¡ W ¢2 n ¡ W ¢2 X {t x {q x q {1 x nq nq q=1
q=1
q=1
Invoking the number of closed walks Zn of length n in graph J (art. 36), Zn =
3.2 The number of walks PQ q=1
41
nq , and the total number Qn of walks (3.11), leads to the inequality ¡ W ¢2 ¡ ¢2 {t x Zn Qn {W1 x Zn ? Q Zn
where the last inequality follows from (3.18). The Q × 1 total walk vector N = (Q> Q1 > Q2 > = = = > QQ 1 ) can be written with (3.11) as 6 5 ¡ W ¢2 6 5 6 5 1 1 ··· 1 1 x {1 Q .. : 9 ¡xW { ¢2 : 9 Q1 : 9 : : 9 9 2 . Q 1 2 Q : 9 9 : 9 1 : 9 : 9 .. . : : 9 .. .. .. .. .. =9 9 :=9 . : : . . ··· . . 9 : 9 ¡ ¢ : 9 2 : 7 QQ2 8 7 Q 2 Q 2 Q 2 Q 2 8 7 xW { 8 1 2 · · · Q 1 Q ¡ W Q1¢2 Q 1 Q 1 Q 1 Q 1 QQ1 x {Q 1 2 · · · Q 1 Q and, in matrix notation, N = YQ () w{ where YQ () is the Vandermonde matrix (8.90) in art. 194 and where the Q × 1 ¢2 ¡ vector w{ has xW {n as its n-th component. Similarly, the closed walk vector W = (Z0 > Z1 > Z2 > = = = > ZQ1 ) is written as W = YQ () x 39. Diameter of a graph. Theorem 5 The number of distinct eigenvalues of the adjacency matrix D is at least equal to + 1, where is the diameter of the graph. ¡ ¢ First proof: Lemma 3 implies that Dn lm is non-zero if and only if node l and m can be joined in the graph by a walk of ¡length ¢ n. Thus, if¡ the¢ shortest path from node l to m consists of k hops, then Dk lm 6= 0, while Dn lm = 0 if n ? k. This means that the matrix Dk cannot be written as a linear combination of L> D> D2 > = = = > Dk1 . By definition of the diameter as the longest shortest path, we thus conclude that the matrices L> D> D2 > = = = > D are linearly independent. Art. 156 shows that the matrix Hn , that represents the orthogonal projection onto the eigenspace of n , is a polynomial in D. Thus, the vector space spanned by L> D> D2 > = = = > D is also spanned by a corresponding set of matrices Hn , which obey P+1 Hn Hp = 1{n=p} (art. 156). Let \ = n=1 fn Hn , then fm = Hm \ , which is only zero if all Hn are linearly independent. The matrices Hn and Hp are only linearly independent if they belong to a distinct eigenvalue of D. The linear independence of the set L> D> D2 > = = = > D thus implies that at least + 1 eigenvalues of D must be distinct. ¤ We may rephrase Theorem 5 as: “The diameter of a graph J obeys o 1, where o is the number of dierent eigenvalues of D”. The second proof may be found easier and more elegant.
42
Eigenvalues of the adjacency matrix
Second proof: As defined in art. 19, the lowest integer , which satisfies (D )lm 6= 0 and (Dp )lm = 0 if p ? for each pair (l> m) of nodes, is called the diameter of the graph J. Suppose that the adjacency matrix D has precisely o distinct eigenvalues. Art. 145 shows that D obeys pfD (D) = R, where the minimal P polynomial pfD ({) = on=0 en } n has degree o. Hence, we may write o1 ¡ o¢ 1 X ¡ n¢ en D lm D lm = eo n=0
which shows that ¡ o ¢ 1. For, assume that A o 1, then there is at least one pair (l> m) for which Dn lm = 0 for 0 n o 1. But, the minimal polynomial then ¢ ¡ ¢ ¡ shows that also Do lm = 0 and, further any Do+t lm = 0 because Dt pfD (D) = R for any integer t 0. This leads to a contradiction that A o 1. ¤ As an example, consider the complete graph NQ whose adjacency matrix has precisely o = 2 distinct eigenvalues, 1 = Q 1 and 2 = 1, as computed in Section 5.1. Theorem 5 states that the diameter is at most = o 1 = 1. Since the diameter is at least equal to = 1, we conclude from Theorem 5 that the diameter in the complete graph equals = 1, as anticipated. 40. The characteristic polynomial of the complement Jf is det (Df L) = det (M D ( + 1) L) ³ ³ ´´ 1 = (1)Q det (D + ( + 1) L) L (D + ( + 1) L) M ³ ´ 1 = (1)Q det ((D + ( + 1) L)) det L (D + ( + 1) L) x=xW where we have used that M = x=xW . Using the “rank 1 update” formula (8.82), we find det (Df L) = (1)Q j () det (D + ( + 1) L)
(3.29)
with the definition 1
j () = 1 xW (D + ( + 1) L) = 1 + }QJ (})|}=
x
1 +1
where the last equation is written in terms of the generating function (3.16) of the total number of walks (art. 34). In general, j () is not a simple function of ° °2 ° 1 ° although a little more is known. For example, j () = 1 °(D + ( + 1) L) 2 x° , 2
which shows that j () 5 (4> 1]. Analogous to derivations in art. 34, we can express j () in terms of “graph angles” as j () = 1 Q
Q X m=1
cos2 m + 1 + m
3.3 Regular graphs
43
which shows that the largest zero of j () lies on the positive real -axis exceeding Q 1. In Section 5.9, we give two methods to approximate this largest zero arbitrarily close. With (8.5), we have fD ( 1) = det (D + ( + 1) L) = QQ n=1 (n + 1 + ). Thus, the characteristic polynomial fDf () of the complement Df is det (Df L) =
Q ¢ (1)Q X ¡ + 1 + m Q 2 cos2 m Q m=1
Q Y
(n + 1 + ) (3.30)
n=1;n6=m
which shows that the poles of j () are precisely compensated by the zeros of the characteristic polynomial fD ( 1). Thus, the eigenvalues of Df are generally dierent from {m 1}1mQ , where m is an eigenvalue of D. Only if x is an n Q eigenvector of D corresponding with n , then j () = +1+ and all eigenvalues +1+n f of D belong to the set {m 1}1m6=nQ ^ {Q 1 n }. According to art. 41, x can only be an eigenvector belonging to 1 when the graph is regular. Combining (3.17) and (3.20) yields, with = }1 , (1)
Q
Q ¡ W ¢2 X {q x fDf ( 1) =1+ fD () q q=1
The right-hand side can be written as a fraction of two polynomials, in which the denominator polynomial has only simple zeros. From this observation, Cvetkovi´c et al. (1995) deduced that, if fD () has an eigenvalue with multiplicity s A 1, then the characteristic polynomial of the complement fDf () contains an eigenvalue 1 with multiplicity s 1 t s + 1.
3.3 Regular graphs The class of regular graph possesses a lot of specific and remarkable properties that justify the discussion of some spectrum related properties here. 41. Regular graphs. Every node m in a regular graph has the same degree gm = u and relation (2.2) indicates that each row sum of D equals u. The basic law of the degree (2.3) reduces for regular graphs to 2O = Q u, implying that, if the degree u is odd, then the number of nodes Q must be even. Theorem 6 The maximum degree gmax = max1mQ gm is the largest eigenvalue of the adjacency matrix D of a connected graph J if and only if the corresponding graph is regular (i.e., gm = gmax = u for all m). Proof: If { is an eigenvector of D belonging to eigenvalue = gmax so is each vector n{ for each complex n (art. 138). Thus, we can scale the eigenvector { such that the maximum component, say {p = 1, and {n 1 for all n. The eigenvalue
44
Eigenvalues of the adjacency matrix
equation D{ = gmax { for that maximum component {p is gmax {p = gmax =
Q X
dpm {m
m=1
which implies that all {m = 1 whenever dpm = 1, i.e., when the node m is adjacent to node p. Hence, the degree of node p is gp = gmax . For any node m adjacent to p for which the component {m = 1, a same eigenvalue relation holds and thus gm = gmax . Proceeding with this process shows that every node n 5 J has same degree gn = gmax because J is connected. Hence, { = x where xW = [1 1 · · · 1] and the Perron-Frobenius Theorem 38 shows that x is the eigenvector belonging to the largest eigenvalue of D. Conversely, if J is connected and regular, then PQ m=1 dpm = gmax = u for each p such that x is the eigenvector belonging to eigenvalue = gmax , and the only possible eigenvector (art. 21). Hence, there is only one eigenvalue gmax = u. ¤ Theorem 6 shows that, for a regular graph, Dx = ux, and, thus, DM = uM. After taking the transpose, (DM)W = MD = uM, we see that DM = MD. Thus, D and M commute if J is regular. Theorem 7 (Homan) A graph J is regular and connected if and only if there exists a polynomial s such that M = s (D). Proof: (a) If M = s (D), then M and D commute and, hence, J is regular. (b) Since the largest eigenvalue u is simple (art. 21), the Laplacian T = uL D has a zero eigenvalue with multiplicity 1. Theorem 11 then states that a regular graph J is connected. Conversely, let J be connected and regular. We can diagonalize the adjacency matrix D of J by using an orthogonal matrix formed by its eigenvectors (art. 151). This basis of eigenvectors of D also diagonalizes M as diag(Q> 0> = = = > 0), because M and D commute. Consider the polynomial t ({) =
Q fD ({) Y = (n (D) {) {u m=2
where fD ({) is the characteristic polynomial of D, then M = Q t(D) t(u) , because the projections on the basisvectors are t (D) {m = 0 if {m 6= x and t (D) x = t (u) x, while Mx = Q x. Thus, the polynomial s ({) = Q t({) t(u) satisfies the requirement. ¤ The proof shows that, if pfD ({) is the minimal polynomial (art. 145) associpfD ({) ated to the characteristic polynomial fD ({) and tpf ({) = {u , the polynomial t
({)
f of possibly lower degree can be found. spf ({) = Q tp p (u) f
42. Strongly regular graphs. Following Cvetkovi´c et al. (1995), we first define ' (y> z) as the number of nodes adjacent to both node y and node z 6= y. In other words, ' (y> z) is the number of common neighbors of both y and z. A regular graph J of degree u A 0, dierent from the complete graph NQ , is called strongly
3.3 Regular graphs
45
regular if ' (y> z) = q1 for each pair (y> z) of adjacent nodes and ' (y> z) = q2 for each pair (y> z) of non-adjacent nodes. A strongly regular graph is completely defined by the parameters (Q> u> q1 > q2 ). For example, the Petersen graph in Fig. 2.3 is a strongly regular graph with parameters (10> 3> 0> 1). Cvetkovi´c et al. (2009) show how many strongly regular graphs can be constructed from line graphs. For example, ³ the line graph o (NQ ) of´ the complete graph is strongly regular with parameters Q(Q21) > 2Q 4> Q 2> 4 for Q A 3. Another example is the class of Paley graphs St , whose nodes belong to the finite field Ft of order t, where t is a prime power congruent to 1 modulo 4, and whose links (l> m) are present if and only if l m is a quadratic residue (see Hardy (1968)). The Paley graph St is strongly regular with parame¡ and Wright ¢ t5 t1 ters |Ft | > t1 . Bollobas (2001, Chapter 13) discusses properties of the > > 2 4 4 Paley graph and its generalizations, the Caley graphs and conference graphs. The number of common neighbors of two dierent nodes l and m is equal to the number of 2-hop walks between l and¡ m. ¢ Thus, Lemma 3 states that ' (l> m) = ¡ 2¢ D lm if l 6= m. Art. 30 shows that D2 ll = gl = u. The condition for strong ¡ ¢ regularity states that, for dierent nodes l and m, D2 lm = q1 dlm + q2 (1 dlm ), because ' (l> m) = q1 if node l and m are neighbors, hence, dlm = 1 and ' (l> m) = q2 , if they are not, i.e. ¡ d¢lm = 0. Adding the two mutual exclusive conditions together with ' (l> m) = D2 lm demonstrates the relation. Combining all entries into a matrix form yields D2 = q1 D + q2 Df + uL Finally, using Df = M L D (art. 1), we obtain the matrix relation that characterizes strong regularity, D2 = (q1 q2 ) D + q2 M + (u q2 ) L ¡ ¢ from which M = q12 D2 + (q2 q1 ) D + (q2 u) L . Hence, the polynomial M = s (D) in Homans Theorem 7 is the quadratic polynomial s2 (}) =
¢ 1 ¡ 2 } + (q2 q1 ) } + (q2 u) q2 t
(u)
f ({ u) s2 ({) from which we deduce that the minimal polynomial pfD ({) = pQ is of degree 3. The definition of a minimal polynomial in art. 211 implies that the adjacency matrix D of J possesses precisely three distinct eigenvalues 1 = u, 2 and 3 , where 2 and 3 are zeros of s2 ({), related by q1 q2 = 2 + 3 and q2 u = 2 3 . The property that strongly regular graphs have three dierent eigenvalues explains why the complete graph NQ must be excluded in the definition above. In summary, we have proved:
Theorem 8 A connected graph J is strongly regular with degree u A 0 if and only if its adjacency matrix D has three distinct eigenvalues 1 = u, 2 and 3 , which
46
Eigenvalues of the adjacency matrix
satisfy q1 = u + 2 + 3 + 2 3 q2 = u + 2 3 where q1 and q2 are the number of common neighbors of adjacent and non-adjacent nodes, respectively.
3.4 Bounds for the largest, positive eigenvalue 1 The largest eigenvalue 1 of the adjacency matrix D appears in many applications. In particular in dynamic processes on graphs, the inverse of the largest eigenvalue 1 characterizes the threshold of the phase transition of both virus spread (Van Mieghem et al., 2009) and synchronization of coupled oscillators (Restrepo et al., 2005) in networks. Sharp bounds or exact expressions for 1 are desirable to control these processes. Bounds for 2 and Q in connected graphs follow from the general bounds (8.56) and (8.57), respectively, on eigenvalues of non-negative, irreducible, symmetric matrices in art. 172. 43. Classical lower bound. The Rayleigh’s inequalities in art. 152 indicate that 1 = sup {6=0
{W D{ {W {
and that the maximum is attained if and only if { is the eigenvector of D belonging W to 1 , while for any other vector | 6= {, 1 ||WD| | . By choosing the vector | = x, we obtain, with (2.5), the classical bound 1
2O xW Dx = xW x Q
(3.31)
Equality is reached in a regular graph, because the average degree is H [G] = 2O Q =u since gm = u for each node m and, because u is the largest eigenvalue of D belonging to the eigenvector x (Theorem 6). The dierences 1 H [G] and gmax 1 can be considered as measures for the irregularity of a graph. The Interlacing Theorem 42 states that 1 is larger than or equal to the largest eigenvalue of any subgraph Jv of J: 1
max (1 (DJv ))
all Jv J
(3.32)
Of course, the lower bounds deduced in this Section 3.4, such as (3.31) and (3.34), also apply to each individual subgraph Jv . It is a matter of ingenuity to find that subgraph Jv with highest largest eigenvalue 1 (DJv ). The lower bound (3.32) can also be deduced from the Rayleigh inequality by choosing zero components in the vector | such that | W D| = zW DJv z, where the vector z contains the non-zero components of | and DJv is the subgraph obtained by deleting those rows and columns that correspond to the zero components in |.
3.4 Bounds for the largest, positive eigenvalue 1
47
We remark that the largest eigenvalue of a non-negative matrix, that is not necessarily symmetric, also obeys the Rayleigh principle (8.28) as can be verified from art. 152 by incorporating the Perron-Frobenius Theorem 38. Hence, most of the deduced bounds in this Section 3.4 also apply to directed graphs, whose adjacency matrix is generally non-symmetric. 44. Applying the Rayleigh’s inequalities to Dn and using art. 144 and (3.8) leads to ¶1 μ W n ¶ n1 μ x D x Qn n 1 = (3.33) xW x Q For example, for n = 2, art. 33 shows that v s u q Q u1 X 2O Var [G] 2 1 t g2n = Var [G] + (H [G]) = 1+ Q Q (H [G])2 n=1
(3.34)
because the variance Var[G] 0 and Var[G] is only zero for regular graphs. The lower bound (3.34) is thus always better than the classical bound (3.31) for nonregular graphs. From the inequality (3.14) in art. 33, we deduce that μ ¶1 ¶1 μ Qn n Q2n 2n Q Q 1 1 ¢ ¢ ¡ ¡ Since the sequence QQ1 > QQ2 2 > QQ4 4 > = = = is generally non-decreasing, while each term is bounded by 1 , we arrive at ¶1 μ Qn n = 1 lim n$4 Q 45. Variations on the Rayleigh inequality. A series of other bounds can be deduced W from the Rayleigh inequality 1 ||WD| | . ´ ³ By choosing the vector | = g1 > g2 > = = = > gQ for some real number , we have PQ P
PQ PQ 1
m=1 dlm gl gm PQ 2 n=1 gn
l=1
=
l=1
m5 neighb ors(l) PQ 2 n=1 gn
(gl gm )
Maximizing the lower bound for is di!cult. The basic law of the degree (2.3) suggests to take = 12 , X p 1 1 gl gm O all pairs (l>m) of neighb ors
From (1.3), we deduce 1 ({1 )m gm maxo is a direct Thus, for any two nodes m and n, it holds that 21 gm gn
maxo is
a direct neighb or of m
({1 )m
neighb or of m
({1 )o maxp is
({1 )o for any node m.
a direct neighb or of n
({1 )n
({1 )p
48
Eigenvalues of the adjacency matrix
When choosing the pair (m> n) such that ({1 )m = maxp is and ({1 )n = maxo is a direct neighb or of m ({1 ), we find that p 1 max gl gm
a direct neighb or of n
({1 )p
all pairs (l>m) of neighb ors
Combining both bounds as X 1 O
p gl gm 1
all pairs (l>m) of neighb ors
max
all pairs (l>m) of neighb ors
p gl gm
yields the improvement of the analogous classical inequalities H [G] 1 gmax . Choosing = 1, equivalent to | = g in Rayleigh’s inequality, yields (art. 33) 1
Q3 gW Dg = gW g Q2
This bound is the special case for p = 1 of 1
Q2p+1 xW D2p+1 x = xW D2p x Q2p
(3.35)
which is obtained from Rayleigh’s inequality for | = Dp x. The classical bound (3.31) is recovered when p = 0. Invoking (3.13) yields for any non-negative integer m and n ¶ μ Qn+m V (n) V (n + m) m 1 + V (n + m) m = 1 1 (3.36) = 1 Qn 1 + V (n) 1 + V (n) where
¶n Q μ X X μ q ¶n cos2 q X μ q ¶n cos2 q q cos2 q V (n) = = + (3.37) 1 cos2 1 1 cos2 1 1 cos2 1 q=2 q A0 q ?0 ¯ ¯ ¯ ¯ Assuming that ¯ q1 ¯ ? 1, which excludes bipartite graphs by Theorem 22, then Q
Q
Q
(3.37) tends exponentially fast in n to zero. Hence, the sequence Qm > Q1+m > Q2+m >=== 1 2 m converges to 1 . Excluding in the sequel regular graphs for which V (n) = 0 and bipartite graphs, we have that ¯ ¯ ¯m ¯¯ X ¯¯ q ¯¯n ¯¯ ¯ q ¯ ¯ cos2 q ¯ ¯ ¯ ¯ ¯ V (n) V (n + m) = 1 ¯ ¯ 1 ¯ ¯ ¯ 1 ¯ ¯ cos2 1 q A0 ¯μ ¶ ¯! ¯ ¯n à m¯ ¯ 2 X ¯ ¯ n ¯ q ¯ 1 (1)m ¯¯ q ¯¯ cos q + (1) ¯ 1 ¯ ¯ 1 ¯ cos2 1 q ?0
which demonstrates for even n = 2p 0 that V (2p) V (2p + m) A 0. Since 1 + V (n) A 0, we deduce from (3.36) that m1
Q2p+m Q2p
(3.38)
from which (3.35) follows alternatively. For odd n = 2p + 1 1 and odd m,
3.4 Bounds for the largest, positive eigenvalue 1
49
the sign of V (n) V (n + m) can be negative. Indeed, we can always rewrite (3.37) as an alternating series with non-increasing (in absolute value) terms. If ¯ ¯ ¯ ¯ ¯ Q1 ¯n cos2 Q 1 ¯ 2 ¯n cos2 2 ¯ 1 ¯ cos2 1 A ¯ 1 ¯ cos2 1 , then ¯ ¯ ¯ ¯ ¯ ¯ ¯ ¯ ¯ Q 1 ¯n cos2 Q 1 ¯ 2 ¯n cos2 2 ¯ Q 2 ¯n cos2 Q 2 ¯ 3 ¯n cos2 3 ¯ ¯ ¯ ¯ ¯ ¯ V (n) = ¯ +¯ ¯ +¯¯ ¯¯ += = = 1 ¯ cos2 1 1 cos2 1 ¯ 1 ¯ cos2 1 1 cos2 1 and we have that ¯ ¯ ¯ ¯ ¯ ¯ ¯ Q 1 ¯n cos2 Q1 ¯ 2 ¯n cos2 2 ¯ Q1 ¯n cos2 Q1 ¯ ¯ ¯ ¯ ¯ ¯ 0?¯ ¯ ¯ V (n) ¯ 1 ¯ cos2 1 1 cos2 1 1 ¯ cos2 1 such that V (n) ? 0 and, similarly, V (n) V (n + m) ? 0. In such a case and confining to m = 1, both the lower and upperbound, Q2p+1 Q2p+2 ? 1 ? Q2p Q2p+1 converge with increasing p to 1 . By applying the inequality (Hardy et al., 1999) d1 + d2 + · · · + dq dn dn min max 1nq tn 1nq tn t1 + t2 + · · · + tq
(3.39)
where t1 > t2 > = = = > tq are positive real numbers and d1 > d2 > = = = > dq are real numbers, we obtain ¡ W ¢2 2p+m PQ ¡ W ¢2 2p+m {q x q q Q2p+m m q=1 {q x = PQ max 2 2p = 1 2 2p 1qQ W W Q2p ({q x) q q=1 ({q x) q establishing the inequality (3.38) again. For example, since V (2n + 2m) ? V (2n), Q4 Q6 2 2 for m = 2, the sequence Q Q0 Q2 Q4 = = = monotonously increases towards 1 . 46. Optimized Rayleigh lower bounds. Yet another choice is | = x + g, where the parameter will be tuned to maximize the Rayleigh lower bound. Introducing this W vector | into Rayleigh’s inequality 1 ||WD| | leads to 1
Q1 + 2Q2 + 2 Q3 2O + 2gW g + 2 gW Dg = Q + 4O + 2 gW g Q0 + 2Q1 + 2 Q2
where we have used Q = Q0 , 2O = xW g = Q1 , gW g = Q2 and gW Dg = xW D3 x = Q3 , as shown in art. 33. The zeros of the denominator Q0 + 2Q1 + 2 Q2 = 0 are p Q1 ± Q12 Q0 Q2 1>2 = Q2 The inequality (3.14) shows that Q12 Q0 Q2 0, implying that the zeros of the denominator are complex (unless for regular graphs). Maximizing the lower bound for yields, after a tedious calculation, p Q0 Q3 Q1 Q2 + Q02 Q32 6Q0 Q1 Q2 Q3 3Q12 Q22 + 4 (Q13 Q3 + Q0 Q23 ) 1 2 (Q0 Q2 Q12 ) (3.40)
50
Eigenvalues of the adjacency matrix
Numerical results in Table 3.1 and Fig. 7.6 show that this bound is better than (3.34), which is not surprising because it includes via Q3 additional information about the graph. Air transport
Random ER
Complete bipartite
80=9576
19=3405
105=5557
18=3079
18=3304
17=8701
bound (3.34)
42=7942
18=8005
105=5557
bound (3.40)
75=9029
19=2867
105=5557
1 exact bound (3.31) =
2O Q
Table 3.1. Comparison of a few lower bounds for 1 . All networks have Q = 1247 nodes. The European direct airport-to-airport tra!c network is obtained from Eurostat, while the Erd˝os-Rénji graph is defined in Section 1.3 and the complete bipartite graph Nq>p in Section 5.7. From a computational point of view, given the Q × Q adjacency matrix D, ¡ 2¢ it is the number of elementary computations for Qn is about R Q ¡, because ¢ 2 2 the addition of the computational complexity of D , and that , which is R Q ¡ 2¢ W n of D3 = DD2 , which ¡ 2 ¢ is another R Q , and so on, and that of Qn = x D x, which is again R Q . On the other hand (see Golub ¡ and ¢ Van Loan (1996)), a full eigenvalue decomposition of D requires at most R Q 3 elementary operations. An extension of the last approach is to choose the vector |=
p X
Dm x m
m=0
such that Rayleigh’s inequality becomes Pp Pp Pp Pp W m+n+1 x m=0 n=0 m n x D m=0 n=0 m n Qm+n+1 = Pp Pp 1 Pp Pp W m+n x m=0 n=0 m n x D m=0 n=0 m n Qm+n The right-hand side is a multi-dimensional function that, in principle, can be optimized for 1 > 2 > = = = > p . 47. Rayleigh’s inequality and the walk generating function. Continuing as in W art. 45, we now propose to choose in the Rayleigh inequality 1 ||WD| | , the vector 4 X |= Dm x } m = x + }g + } 2 Dg + = = = m=0
which converges for |}| ? 1 1 (art. 34). Using the Cauchy product of power series
3.4 Bounds for the largest, positive eigenvalue 1
51
yields W
| |= =
4 X
W
p
x D
}
p
p=0 4 X
4 X
m
4 X
m
D x} =
m=0
n=0
Ã
n X
! W
np
x D
p
D x }n
p=0
(n + 1) xW Dn x } n
n=0
Written in terms of the generating function (3.15) of the total number of walks in a graph J results in |W | =
4 X
(n + 1) Qn } n =
n=0
g (}QJ (})) g}
Similarly, we find that 4 X
| W D| =
(n + 1) Qn+1 } n =
n=0
gQJ (}) g}
Rayleigh’s inequality becomes, for |}| ? 1 1 , 1
gQJ (}) g} g g}
(}QJ (}))
=
gQJ (}) g} J (}) } gQg} + QJ (})
(3.41)
For example, for regular graphs, whose generating function (3.19) of the total number walks is particularly simple, equality in (3.41) is established for all |}| ? 1 1 . Conversely, the solution of the dierential equation deduced from (3.41) with equality sign is precisely the generating function (3.19) of regular graphs. When } = 0, (3.41) reduces to 1 QQ1 , which is the classical lower bound (3.31). For small }, we substitute the power series of QJ (}) up to order three in } in the right-hand side of (3.41), ¡ ¢ Q1 + 2Q2 } + 3Q3 } 2 + R } 3 1 Q0 + 2Q1 } + 3Q2 } 2 + R (} 3 ) which shows that the right-hand side is similar to the -variant in art. 45 that led to (3.40) and that it increases from 0 with }, because Q3 A Q2 A Q1 A Q0 . The function on the right-hand side of (3.41) is thus maximal when ¶2 μ g2 QJ (}) gQJ (}) = 2 QJ (}) g} 2 g} whose solution for real }, provided QJ (}) is known, will lead to the best lower bound for 1 in (3.41). On the other hand, this dierential equation can be solved for QJ (}). Rewritten as 1 gQJ (}) g}
2 gQJ (}) g2 QJ (}) = 2 g} QJ (}) g}
52
Eigenvalues of the adjacency matrix
and integrating both sides from 0 to } gives ¯ ¶ μ gQJ (}) ¯¯ gQJ (}) QJ (}) log log = 2 log g} g} ¯}=0 QJ (0) ¯ J (}) ¯ Using QJ (0) = Q and gQg} = Q1 = 2O, we obtain after simplification, ¯ }=0
gQJ (})
=
(QJ (}))2
2O g} Q2
After integrating both sides for 0 to } and after some rearrangement, we arrive at Q 1 2O Q }
QJ (}) =
which is, again, the generating function (3.19) of a regular graph because H [G] = 2O Q = u. At last, we can rewrite the inequality in (3.41) as 1
1 }+
QJ (})
gQJ (}) g}
or 1 }+ 1
1 g log QJ (}) g}
48. An improvement of the classical bound (3.31) in terms of the total number (3.8) of walks Qn is derived in Van Mieghem (2007) (and improved in Walker and Van Mieghem (2008)), μ ¶ Q3 Q1 Q2 Q1 Q13 4 1 +2 2 + ) (3.42) 0 + R(w Q 2Q Q2 2Q 3 s where w W , 0 = w Q , X 1 |dlm |) (3.43) max (dmm + W =s Q 1mp l6=m Since Q1 = xW Dx = 2O, the first term in (3.42) is the classical bound (3.31). The Lagrange series (3.42) with terms containing powers of 2m for m A 0 measures the 0 irregularity 1 H [G] of the graph. 49. A direct consequence of art. 24 is that the largest eigenvalue 1 is bounded by r 2O (Q 1) 1 (3.44) Q and equality in (3.44) occurs for the complete graph NQ (see Section 5.1). PQ Alternatively, in terms of the average degree gd = Q1 m=1 gm = 2O Q , the largest eigenvalue 1 is bounded by the geometric mean of the average degree and the
3.4 Bounds for the largest, positive eigenvalue 1 53 p maximum possible degree, 1 gd (Q 1). Combining the lower bound (3.34) and upper bound (3.44) with art. 23 yields s (r ) 2O Var [G] 2O (Q 1) > gmax 1+ (3.45) 2 1 min Q Q (H [G]) More generally, combining Theorem 63, art. 23 and art. 44 gives for any integer n1 ;Ã < 1 ! 2n μ ¶1 ? @ Q2n 2n Z2n (3.46) 1 min > g max = 1 + (Q 1)12n > Q where Zn is the number of closed walks with n hops. For n = 1, (3.46) reduces to (3.45). ¯ ¯ ¯ ¯ When we assume that ¯ q1 ¯ ? 1 for all 2 q Q , which, as mentioned in art. 45, excludes bipartite graphs, the definition of Zn (art. 36) indicates that ; < ( ¯ ) ¯ ¶n @ Q μ ? X ¯ max (2 > Q ) ¯n m n n ¯ ¯ ? 1 1 + (Q 1) ¯ Zn = 1 1 + ¯ = > 1 1 m=2 1@n
1@n
This implies that Zn is decreasing in n, because (1 + {) is for { A 0 and, in ³ ´n 1@n max(2 >Q ) addition, is exponentially decaying in n. Hence, limn$4 Zn = 1 . 1 While the left-hand side of (3.46) is increasing in n (art. 44), the right-hand side is decreasing in n. Together, they provide increasingly sharp bounds for 1 when n increases. 50. Bounds for connected graphs. As will be deduced in Section 4.1.1, a connected graph has an adjacency matrix that is irreducible (Section 8.5). We apply the bounds (8.54) in art. 169 to D2 by choosing | = x, ¡ ¡ ¢ ¢ min D2 x l 21 max D2 x l 1lQ
1lQ
¡ ¢ PQ P where D2 x l = (Dg)l = m=1 dlm gm = m5neighbors(l) gm . Thus, s min
1lQ
s
X
gm 1 max
m5neighb ors(l)
1lQ
X
gm
(3.47)
m5neighb ors(l)
Invoking the basic law of the degree (2.3), we have X ¡ 2 ¢ D x l = 2O gl gm 2O gl (Q 1 gl ) m 5neighbor(l) @
where the inequality arises from the connectivity of the graph, ¡ which ¢ implies that the degree gm of each node m is at least one. Thus, max1lQ D2 x l = 2O Q + 1
54
Eigenvalues of the adjacency matrix
and this maximum is reached in the complete graph NQ and in the star N1>Q1 . Hence, for any connected graph, we obtain the bound s 1 2O Q + 1 (3.48) which is sharper than (3.44), but the latter bound did not assume connectivity of the graph. When choosing | = g in (8.54) in art. 169, we obtain a companion of (3.47) for connected graphs: X X 1 1 min gm 1 max gm (3.49) 1lQ gl 1lQ gl m5neighb ors(l)
m5neighb ors(l)
51. From the inequality (8.42) for Hölder t-norms, we find for s A t A 0 that PQ PQ t s t s , n=1 |n | ? n=1 |n | ? ¯P ¯ P ¯ Q s¯ Since Q n=1 n = 0, not all n can be positive and combined with ¯ n=1 n ¯ ¯P ¯ PQ ¯ Q s s¯ s | | , we also have that ¯ n n=1 n=1 n ¯ ? . Applied to the case where t = 2 ¯P ¯ P ¯ Q 2 2 3¯ 3 and s = 3 gives the following implication: if Q ? then ¯ 1 n=2 n n=2 n ¯ ? 1 . In that case, the number of triangles given in (3.3) is ¯ ¯Q Q 1 3 1X 3 1 3 1 ¯¯X 3 ¯¯ NJ = 1 + n 1 ¯ n ¯ A 0 ¯ 6 6 6 6¯ PQ
n=2
n=2
+ ? then the number of triangles NJ in J is at Hence, if 2O = s least one. Equivalently, in view of (3.2), if 1 A O then the graph J contains at least one triangle. 2 n=2 n
21
221 ,
52. A theorem of Turan states that: Theorem 9 A graph J with Q nodes and more than one triangle.
h
Q2 4
i links contains at least
h 2i 2 This theorem is a consequence of art. 51. For, using O A Q4 Q4 , which is s equivalent to Q ? 2 O in the bound on the largest eigenvalue (3.31), s 2O 2O 1 A s = O Q 2 O s and 1 A O is precisely the condition in art. 51 to have at least one triangle. 53. The graph formed by the union of all hop paths, defined in art. 20, h shortest i Q2 between node x and node y has at most 4 links. Indeed, the union of two shortest paths P1 and P2 between the same sourcedestination pair cannot have a triangle. For, suppose that there were a triangle between three nodes l, m and n in the union P1 ^ P2 . Since the link l $ n is a
3.5 Eigenvalue spacings
55
subsection of a shortest hop path, it obeys the strict triangle inequality (all z = 1 are the same), z (l $ n) ? z (l $ m) + z (m $ n) otherwise the link l $ n is not the shortest hop path from l to n. Hence, the subsection l $ m $ n is not a shortest hop path. The triangle inequality thus implies that the union of the shortest hop paths between the same source-destination pair cannot have a triangle.h Turan’s Theorem 9 then states that the number of links in i Q2 that union is at most 4 . 54. We can deduce a set of lower bounds for 1 by considering (1.4). The PerronFrobenius theorem, as explained in art. 21, states that all eigenvector components are non-negative, which leads in (1.4) to the bound p p 1 A (D )mm
where (Dp )mm equals the number of closed p-hop walks starting and ending at node m (see art. 17). Since the bound holds for any node m and any integer p 1, we arrive at r 1 A max p1
p
max (Dp )mm
1mQ
(3.50)
The largest eigenvalue of the adjacency matrix is at least as big as the p-th root of the largest number of p-hop cycles around a node in the graph. For example, s invoking art. 30, (3.50) shows in the case p = 2 that 1 A gmax . The lower bound (3.50) is, in general, weak. The related upper bound v u Q X u p 1 max t max (Dp )lm p1
1lQ
follows from (8.51) and (8.47). Since Zp = is dierent from (3.46).
m=1
PQ m=1
(Dp )mm , the above upper bound
3.5 Eigenvalue spacings The dierence n n+1 , for 1 n Q 1, between two consecutive eigenvalues of the adjacency matrix D is called the n-th eigenvalue spacing of D. Only basic and simple, but general relations are deduced. Higher order dierences (see art. 207) are not considered, nor the combination with the powerful Interlacing Theorem 42 in art. 180. 55. Spectral gap. The dierence between the largest eigenvalue 1 and second largest 2 , called the spectral gap, is never larger than Q : 1 2 Q
(3.51)
56
Eigenvalues of the adjacency matrix
Indeed, since 1 A 0 as indicated by (3.45), it follows from (3.1) that 0=
Q X
n = 1 +
n=1
Q X
n 1 + (Q 1)2
n=2
such that 2
1 Q 1
Hence, Q 1 1 = Q 1 Q 1 Art. 23 states that the largest possible eigenvalue is 1 = Q 1, attained in the complete graph, which proves (3.51). Again, the equality sign in (3.51) occurs in case of the complete graph (see Section 5.1). When a link is removed in the complete graph, the spectral gap drops by at least 1 (see Section 5.10). The spectral gap plays an important role in the dynamics of processes on graphs (art. 64) and it characterizes the robustness of a graph due to its relation with the algebraic connectivity (art. 74 and Section 4.2). 1 2 1 +
56. Eigenvalue spacings. The sum over all spacings between two consecutive eigenvalues equals Q 1 X (n n+1 ) = 1 Q (3.52) n=1
Since each spacing n n+1 0, the largest possible spacing occurs when all but one spacing is zero, in which case max1nQ 1 n n+1 is equal to 1 Q . However, each spacing consists of two consecutive eigenvalues, which implies that Q = 2 (or Q 1 = 1 ). Art. 55 shows that the largest possible spacing is attained in the complete graph and is equal to Q , the largest possible spectral gap. Let denote an arbitrary spacing between two consecutive eigenvalues, then the telescoping series (3.52) shows that its average equals H [] =
1 Q 2gmax Q 1 Q 1
h i 2 2 The variance Var[] = H () (H []) is, however, more di!cult to compute, because it requires the determination of the sum i h 2 H () = PQ 1
or equivalently, of the sum Abel’s partial summation q X n=1
dn en =
n=1
q1 X n=1
Q 1 1 X 2 (n n+1 ) Q 1 n=1
n n+1 .
à n ! à q ! X X do (en en+1 ) + eq do o=1
o=1
(3.53)
3.5 Eigenvalue spacings
57
applied to (3.1) shows that Q 1 X
n (n n+1 ) = Q Q
n=1
Invoking (3.39) with dn = n (n n+1 ) and tn = n yields bounds for the minimum and maximum spacing between consecutive eigenvalues of the adjacency matrix D: 0
min
1nQ1
n n+1
2Q max n n+1 Q 1 1nQ 1
Relation (8.57) in art. 172 implies that
»
Q
Q 2
(3.54)
¼
such that the minimum spacing is never larger than min
1nQ 1
n n+1
» ¼ Q 2 Q 1 2
57. Inequalities for Q . Besides the general bounds in art. 172, new bounds for the smallest eigenvalue Q of the adjacency matrix D can be deduced, when known relationships are rewritten in terms of the spacings. Partial summation (3.53) of the total number of closed walks (3.24) yields, for any integer 0 p n, Ã m ! Q Q 1 X X X np n p Zn = o = o np Zp (3.55) (np m m+1 ) + Q m=1
m=1
o=1
while the generalization of the telescoping series (3.52) is, for any q, Q 1 X
¡ q ¢ m qm+1 = q1 qQ
(3.56)
m=1
The dierence qm qm+1 can be negative when eigenvalues are negative and q is P even. The sum mo=1 p o is always positive for m ? Q , which is immediate for even p. For odd p and denoting by t the index such that t 0 and t+1 ? 0, we can write m t m X X X p p = + p o o o o=1
o=1
o=t+1
where the first sum is strictly positive and the second is strictly negative. The secP p ond sum decreases with increasing m, and is thus larger than or equal to Q1 o=t+1 o . PQ 1 p However, in that extreme case where m = Q 1, the sum o=1 o = Zp p Q A 0. Pm p The minimum value of the sum o=1 o is attained for even p at m = 1 and for p p p odd p at either m = 1, if p 1 ? Zp Q , or at m = Q 1, if 1 A Zp Q . If
58
Eigenvalues of the adjacency matrix
p = 1, the minimum occurs at m = Q 1 provided 1 A |Q |, which excludes, as in art. 45, bipartite graphs. Pm np With this preparation, the inequality (3.39), with dm = tm o=1 p o , tm = m np m+1 A 0 and n p is odd, becomes, using (3.55) and (3.56), m X Zn np Zp p p Q min p o = min (Zp Q > 1 ) 1{p is 1mQ 1 np np 1 Q o=1
p odd} +1 1{p is even}
from which we arrive at the bound, for even p and for odd p provided Zp p Q A p 1 , Zn n1 np Q Zp p 1
(3.57)
p and, for odd p provided Zp p Q ? 1 ,
Zn nQ np 1 Zp p Q
(3.58)
For example, for n p = 1 and excluding bipartite graphs, (3.58) reduces for n = 2 and p = 1 and using (3.2) to 2O 2Q 1 Q from which we deduce that Q
1 2
μ q ¶ 2 1 + 8O + 1
For n = 3 and p = 2, and using (3.3), (3.57) becomes 6NJ 31 Q 2O 21 ´ PQ 1 ³Pm p Since we can only compute the sum m=1 for p = 0, the inequality o=1 o (3.39), with dm = tm (nm nm+1 ) and tm = m, yields for all integer n 0, using (3.55), ¡ ¢ 2 Zn Q nQ n n max nm nm+1 (3.59) min m m+1 1mQ 1 1mQ1 Q (Q 1) which is the generalization of (3.54). In particular, for odd values of n = 2q + 1, that conserve the ordering in the powers of eigenvalues, i.e., 2q+1 2q+1 m m+1 for all 1 m Q 1, the bounds in (3.59) can be of interest.
3.6 Additional properties 58. Cliques and cocliques. A clique of size p in a graph J with Q p nodes is a set of p pairwise adjacent nodes. Only when p = Q or the clique is a disjoint subgraph of J, the clique is a complete graph and each node has degree p 1. A
3.6 Additional properties
59
coclique is the complement of a clique; thus, a set of pairwise non-adjacent nodes. The clique number is the size of the largest clique, while the independence number is the size of the largest coclique. Suppose that J has a coclique of size f. We can always relabel the nodes such that the nodes belonging to that coclique possess the first f labels. The corresponding adjacency matrix D has the form " # Rf×f If×(Qf) D= IW Ie(Qf)×(Q f) (Q f)×f
Since the principle matrix Rf×f has f eigenvalues equal to zero, the Interlacing Theorem 42 shows that, for 1 m f, Q f+m (D) 0 m (D) Hence, the adjacency matrix has at least f non-negative and Q f + 1 non-positive eigenvalues. The converse is that the number q+ = {m : m (D) 0} of non-negative eigenvalues of D provides an upper bound for the independence number. Also, the number q = {m : m (D) 0} of non-positive eigenvalues of D bounds the independence number by Q q . Only for the complete graph NQ , where f = 1, there is only one positive eigenvalue. If one link (e.g. between node 1 and 2) in the complete graph is removed, the coclique has size f = 2, and two eigenvalues are non-negative. Consequently, the second largest eigenvalue 2 in any graph apart from NQ is at least equal to zero. Another argument is that, apart from the complete graph, any graph possesses the star N1>2 as a subgraph, whose adjacency eigenvalues are computed in Section 5.7. It follows then again from the Interlacing Theorem 42 that 2 0. Similarly, if J has a clique of size f, then, after relabeling, the adjacency matrix has the form " # (M L)f×f Jf×(Qf) D= e (Qf)×(Q f) JW J (Q f)×f
Since the principle matrix (M L)f×f has an eigenvalue f 1 and (1)[f1] eigenvalues by (5.1), the Interlacing Theorem 42 shows that, Q f+1 (D) f 1 1 (D) and, for 2 m f, Qf+m (D) 1 m (D) The bounds for the clique are less elegant than those for the coclique. 59. Almost all non-star-like trees are not determined by the spectrum of the adjacency matrix (van Dam and Haemers, 2003). Godsil and Royle (2001) start by the remark that the spectrum of a graph does not determine the degrees, nor whether the graph is planar and that there are many graphs that are co-spectral, i.e., although graphs are dierent, their spectrum is the same. Cvetkovi´c et al. (2009)
60
Eigenvalues of the adjacency matrix
devote a whole chapter on the characterization of graphs by their spectrum. They list theorems on graphs that are determined by their spectrum (such as regular graphs with degree u = 2 and complete bipartite graphs), but they also present counter examples. Finally, van Dam and Haemers (2003) conjecture that su!ciently large graphs are determined by their spectrum, roughly speaking because the probability of having co-spectral graphs becomes vanishingly small when the number of nodes Q increases. 60. Addition of a node to a graph. When one node q is added to a graph JQ to form the graph JQ+1 , the adjacency matrix of the latter is expressed as " # D y Q Q×1 DQ+1 = ¡ W ¢ (3.60) y 1×Q 0 where yQ ×1 is the zero-one connection vector of the new node q to any other node in JQ . The analysis below can be complemented with that in art. 181. The characteristic polynomial of DQ +1 is, invoking (8.79), ¸ DQ L y det (DQ +1 L) = det yW μ ³ ´ ¶ 1 = det (DQ L) det y W (DQ L) y 1×1 ³ ´ 1 W = + y (DQ L) y det (DQ L) With the expansion of the resolvent of D, 1
(D L)
4 ¢1 1¡ 1 X Dn 1 = L 1 D = = n n=0
we can write 1 X yW DnQ y 1 y= = n 4
1
W
y (DQ L)
n=0
μ
¶ D D2 L + + 2 + ··· (3.61)
Ã
4 X yW DnQ y gq + n
!
n=1
where y W y = gq is the degree of node q. If we denote the characteristic polynomial P n of DQ by fDQ () = Q n=0 fn (Q ) , then we obtain à ! Q Q +1 4 X X yW DnQ y X n fn (Q + 1) = + fn (Q ) n n+1 n=0
n=0
=
Q X
fn (Q ) n+1 +
n=0
=
Q +1 X n=1
n=0
Q 4 X X
¡ ¢ fm (Q ) y W DnQ y mn1
n=0 m=0
fn1 (Q ) n +
Q1 X
Q X
³ ´ mp1 fm (Q ) y W DQ y p
p=4 m=max(0>p+1)
3.6 Additional properties
61
Equating corresponding powers in yields1 , for 1 n Q 1, apart from Q +1 fQ +1 (Q + 1) = (1) and fQ (Q + 1) = fQ 1 (Q ) = 0, a recursion that expresses the coe!cients of the characteristic polynomial of DQ +1 in terms of those of DQ , Q ³ ´ X m(n+1) fm (Q ) y W DQ y fn (Q + 1) = fn1 (Q ) + m=n+1
while, for n = 0, f0 (Q + 1) =
Q X
³ ´ fm (Q ) y W Dm1 Q y = det DQ+1
m=1
Given the coe!cients {fn (Q )}0n?Q 1 , the quadratic forms un (y) = y W DnQ y for 1 n ? Q constitute the major computational eort to determine the coe!cients {fn (Q + 1)}0n?Q . Starting with Q = 2, the set can be iterated up to any size Q and any structure in DQ , each Q producing the set of coe!cients {fn (Q )}0n?Q 1 of a polynomial with integer coe!cients and real zeros lying in the interval ( (Q 1) > Q 1]. Moreover, art. 180 shows that all eigenvalues of DQ interlace with those of DQ+1 . These properties are also shared by orthogonal polynomials (see Chapter 10). Suppose that y is an eigenvector of D with eigenvalue y , then y = max (DQ ) = 1 by the Perron-Frobenius Theorem 38 because y has non-negative components2 . Hence, if y is the eigenvector belonging to the largest eigenvalue and scaled to have only zero and one components, DQ y = 1 y and (DQ L)1 y = (1 )1 y for 6= 1 such that ´ ³ gq 1 = y W (DQ L) y 1 1×1 and
¢ det (DQ L) ¡ det (DQ+1 L) = 2 1 gq 1
Hence, if y is the (unscaled) eigenvector of DQ belonging to the largest eigenvalue whose norm is kyk22 = yW y = gq , then the spectrum of DQ+1 consists of all eigenvalues of DQ , except for = 1 and two new eigenvalues, s ! Ã gq 1 1± 1+4 2 2 1 1
Observe that, for p ? 0, an identity is found because 3 4 Q [ m D 3p31 W C y fm (Q) DQ DQ y=0 m=0
2
S m by the Caley-Hamilton Theorem (art. 145), stating that fDQ (DQ ) = Q m=0 fm (Q) DQ = 0. If y has zero components, then D is reducible, which implies that the graph J is disconnected.
62
Eigenvalues of the adjacency matrix
In other words, the largest eigenvalue 1 of DQ is split up into a slightly larger one and a smaller one with strength related to the degree gq . Such a vector y exists, for example, when y = x and DQ is the adjacency matrix of a regular graph (art. 41). 61. Invoking (8.80), we obtain the alternative expression for the determinant ¶ ¸ μ yy W DQ L yQ ×1 (3.62) = det D det L + Q yW For any complex number }, the determinant det (DQ +1 L) can be split into two others: ¸ ¸ ¸ DQ L yQ×1 DQ L yQ ×1 DQ L yQ ×1 = det + det det yW y W zW } zW } The particular case where y = z = x, then reduces, for any } = 6 0, to ¸ ¸ DQ L xQ ×1 DQ L DQ L xQ×1 det = det det W W x x } 01×Q
xQ×1 +}
¸
When adding }1 times the last row to each other row in the first determinant, we obtain, with M = x=xW , ¶ μ 1 det (DQ +1 L) = } det DQ M L ( + }) det (DQ L) (3.63) } which reduces, for } = , to (3.62). Since the adjacency matrix of the complement Jf equals Df = M L D, choosing } = 1 in (3.63) results in det (DQ+1 L) = (1)Q det (DfQ + ( + 1) L) ( + 1) det (DQ L) When a node that connects to all other nodes in JQ is added such that y = x, the resulting graph JQ +1 is called the cone of JQ . The cone is always a connected graph. The cone construction is useful to convert a reducible matrix into an irreducible one, or to connect a graph with several disconnected clusters of components. An interesting application occurs in Google’s PageRank as discussed in Van Mieghem (2006b, pp. 224-228). Finally, in case y = x, the quadratic forms in art. 60, un (x) = xW DnQ x = Qn , represent the total number of walks with n hops (art. 33). 62. If is an equitable partition of the connected graph J, then the adjacency matrix D and the corresponding quotient matrix D have the same spectral radius. Indeed, art. 15 shows that the eigenvalues of the quotient matrix corresponding to an equitable partition are a subset of the eigenvalues of the symmetric matrix. Moreover, any eigenvector y of D belonging to eigenvalue is transformed to an eigenvector Vy with the same eigenvalue . The Perron-Frobenius Theorem 38 states that the eigenvector belonging to 1 is the only one with non-negative components. Both D and D are non-negative matrices. Since the characteristic matrix V of the partition has positive elements, both the eigenvector y and Vy have positive vector components and, thus, must belong to the spectral radius.
3.7 The stochastic matrix S = 1 D
63
63. The spectral radius of any tree with maximum degree gmax A 1 is smaller than s 2 gmax 1. Indeed, Lemma 2 and 7 show that the spectral radius of any tree is at most equal to that of a centrally symmetric tree Wgmax as defined in art. 16. Art. 62 allows us to concentrate on the quotient matrix D instead of the adjacency matrix. f derived in Gershgorin’s Theorem 36, applied to the transformed quotient matrix D s art. 16 shows that all eigenvalues are smaller than 2 gmax 1 because sggmax1 ? max s 2 gmax 1 for gmax A 1. 3.7 The stochastic matrix S = 1 D 64. The stochastic matrix S = 1 D, introduced in art. 3, characterizes a random walk on a graph. A random walk is described by a finite Markov chain that is timereversible. Alternatively, a time-reversible Markov chain can be viewed as a random walk on an undirected graph. Random walks on graphs have many applications in dierent fields (see, e.g., the survey by Lovász (1993) and the relation with electric networks by Doyle and Snell (1984)); perhaps the most important application is randomly searching or sampling. The combination of Markov theory and algebra leads to interesting properties of S = 1 D. The left-eigenvector of S belonging to eigenvalue = 1 is the steadystate vector (which is a 1 × Q row vector, see Van Mieghem (2006b)). The corresponding right-eigenvector is the all-one vector x. These eigenvectors obey the eigenvalue equations S W W = W and S x = x and the orthogonality relation x = 1 (art. 140). If g = (g1 > g2 > = = = > gQ ) is the degree vector, then the basic law ¡ g ¢W for the degree (2.5) is rewritten as 2O x = 1. The steady-state eigenvector is ¡ g ¢W x=1 unique (see Van Mieghem (2006b)) such that the equations x = 1 and 2O imply that the steady-state vector is μ ¶W g = 2O or gm m = (3.64) 2O In general, the matrix S is not symmetric, but, after a similarity transform K = 1@2 , a symmetric matrix U = 1@2 S 1@2 = 1@2 D1@2 is obtained whose eigenvalues are the same as those of S (art. 142). The powerful property (art. 151) of symmetric matrices shows that all eigenvalues are real and that U = X diag(U ) X W , where the columns of the orthogonal matrix X consist of the normalized eigenvectors yn that obey ymW yn = mn . Explicitly written in terms of these eigenvectors gives (art. 156) U=
Q X n=1
n yn ynW
64
Eigenvalues of the adjacency matrix
where, with the Perron-Frobenius Theorem 38, the real eigenvalues are ordered as 1 = 1 2 · · · Q 1. If we exclude bipartite graphs (where the set of nodes is N = N1 ^ N2 with N1 _ N2 = B and where each link connects a node in N1 and in N2 ) or reducible Markov chains (art. 167), then |n | ? 1, for n A 1. Art. 142 shows that the similarity transform K = 1@2 maps the steady state vector into y1 = K 1 W and, with (3.64), 1@2 W ° y1 = ° °1@2 W ° 2 or
s
r
gm 2O
y1m = s μ s ¶2 = PQ gm m=1
gm s = m 2O
2O
Finally, since S = 1@2 U1@2 , the spectral decomposition of the transition probability matrix of a random walk on a graph with adjacency matrix D is S =
Q X
n 1@2 yn ynW 1@2 = x +
n=1
Q X
n 1@2 yn ynW 1@2
n=2
¢ ¡ The q-step transition probability is, with yn ynW lm = ynl ynm and (3.64), Slmq
gm + = 2O
r
Q gm X q n ynl ynm gl n=2
The convergence rate towards the steady state m , also coined the “mixing rate”, can be estimated from r r Q Q X ¯ q ¯ gm X q q ¯Slm m ¯ gm |n | |ynl | |ynm | ? |n | gl gl n=2
n=2
Denoting by = max (|2 | > |Q |) and by 0 the largest element of the reduced set {|n |} \ {} with 2 n Q , we obtain r ¯ q ¯ ¯Slm m ¯ ? gm q + R (0q ) gl Hence, the smaller or, equivalently, the larger the spectral gap |1 | |2 | 1 , the faster the random walk converges to its steady-state. 65. The stochastic matrix S = 1 D can also be expressed in terms of the Laplacian T = D as S = L 1 T. This shows that the eigenvector { of S with corresponding eigenvalue is the same as that of the normalized Laplacian 1 T belonging to e = 1 and 0 e 2. Hence, the spectral gap of a stochastic matrix S also equals the second smallest eigenvalue of normalized Laplacian
3.7 The stochastic matrix S = 1 D 65 ¢ ¡ ¢ ¡ 1 T. Moreover, trace(S ) = trace(D) = 0 and trace S 2 = trace U2 implies, d with (U)lm = s lm , that gl gm
Q X
Q Q X X d d dlm p lm p ml = g g gl gm gl gm l=1 m=1 l=1 m=1 l m ³ ´2 ¾ 1 1 , we obtain that gl gm
2n (S ) =
n=1
½ With
1 gl gm
=
1 2
1 g2l
+
1 g2m
Q Q X X
μ ¶2 Q Q Q Q X Q Q Q Q X 1 1X 1 X 1X 1 X 1 XX 1 dlm = dlm + dml dlm gg 2 l=1 g2l m=1 2 m=1 g2m l=1 2 l=1 m=1 gl gm l=1 m=1 l m μ ¶2 Q Q X l1 X X 1 1 1 = dlm g gl gm l=1 l l=1 m=1
Thus, Q X n=1
2n
μ ¶2 Q Q X l1 X X 1 1 1 (S ) = dlm g gl gm l=1 l l=1 m=1
PQ 1 P 1 1 which shows that n=1 2n (S ) Q l=1 gl , where Q l=1 gl is the harmonic mean of the degree set {gl }1lQ . Only for regular graphs where gl = u, the double sum PQ disappears and n=1 2n (S ) = Qu . Since PQ
Q X n=1
2n (S ) =
Q Q 1 X X ¡ ¡ ¢¢2 1 n 1 T =1+ (1 en )2 n=1
n=1 2
1 + (Q 1) (1 e2 )
we find, for regular graphs, an upper bound for the spectral gap e2 1 A tight upper bound s ¶ μ gmax 1 2 2 + 1 e2 1 2 gmax
q
Q u u(Q 1) .
for a graph with diameter 4 is derived by Nilli (1991) using Rayleigh’s equation (4.12) and some ingenuity.
4 Eigenvalues of the Laplacian T
In the sequel, we denote the eigenvalues of the Laplacian T by to distinguish them from the eigenvalues of the adjacency matrix D.
4.1 General properties 66. The Laplacian T = D is symmetric because D and are both symmetric. Symmetry T = TW also follows from the other definition T = EE W . The quadratic form defined in art. 160, ° °2 {W T{ = {W EE W { = °E W {°2 0 (4.1) is positive semidefinite, which implies that all eigenvalues of T are non-negative and at least one is zero because det T = 0 as shown in art. 2. Thus, the zero eigenvalue is the smallest eigenvalue of T. The eigenvector belonging to the zero eigenvalue is P x because Q n=1 tln = 0 for each row 1 l Q ; in vector notation, Tx = 0. We order the real, non-negative eigenvalues of the Laplacian T as 0 = Q Q 1 · · · 1 . Similarly as for the adjacency matrix (art. 22), none of the eigenvalues of the Laplacian is a fraction of the form de , where d and e are co-prime and e A 1. Only integer and irrational eigenvalues are possible. 67. Since T is a symmetric matrix, all eigenvectors {1 > {2 > = = = > {Q are orthogonal (art. 151). Art. 66 shows that the eigenvector {Q = x belonging to the smallest eigenvalue Q = 0, such that, for all 1 m Q 1, xW {m =
Q X
({m )n = 0
n=1
Thus, the sum of all vector components of an eigenvector, dierent from {Q = x, is zero. When these eigenvector components are ranked in increasing order, then the smallest and largest eigenvector component of {m 6= x, with 1 m Q 1, have a dierent sign. 68. Gerschgorin’s Theorem 36 states that each eigenvalue of the Laplacian lies 67
Eigenvalues of the Laplacian T
68
in an interval | gm | gm around a degree gm -value. Hence, 0 2gm which shows that Gerschgorin’s Theorem 36, alternatively to art. 66, demonstrates that T is positive semidefinite. Moreover, 1 2gmax . This same bound (4.10) is also found by considering the non-negative matrix gmax L T whose largest eigenvalue is gmax and smallest eigenvalue is gmax 1 . The Perron-Frobenius Theorem 38 states that the positive largest eigenvalue is larger than the absolute value of any other one eigenvalue, whence gmax |gmax 1 |. This inequality is essentially the same as Gerschgorin’s and, thus, it implies (4.10). 69. The definition of T = D and (3.1) show that trace(T) = trace() = PQ m=1 gm . The basic law of the degree (2.3) and relation (8.7) combine to Q X
n = 2O
(4.2)
n=1
Hence, the average value of a Laplacian eigenvalue equals the average degree, H [] = H [G]. Corollary 1 shows that any partial sum with 1 m Q of ordered eigenvalues satisfies m X
g(n)
n=1
m X
n
(4.3)
n=1
where g(n) denotes the n-th largest degree in the graph, i.e., g(Q ) g(Q 1) · · · g(1) . 70. Applying the general relation (8.20) to the Laplacian yields Q X
¡ ¢ 2n = trace T2
n=1
The square equals ³ ´ T2 = ( D)2 = 2 + D2 D + (D)W such that Q ¡ ¢ X ¡ ¢ trace T2 = g2n + trace D2 n=1
Using (3.5) leads to Q X n=1
2n =
Q X n=1
g2n + 2O
(4.4)
4.1 General properties
69
Stochastically1 , when considering the eigenvalue and the degree G in a graph as a random variable, (4.4) translates to Var [] = Var [G] + H [G] £ ¤ where the variance Var[[] = H [ 2 (H [[])2 for any random variable [. Since H [G] A 0 (excluding graphs without links), the variability of the Laplacian eigenvalues is larger than that of the degree G in the graph. Applying Corollary 1 yields, for 1 m Q , m X
g2(n)
+
n=1
m X
g(n)
n=1
m X
2n
(4.5)
n=1
where g(n) denotes the n-th largest degree in the graph. 71. The case for the third powers in (8.20) needs the computation of the trace of T3 = ( D)3 = 3 2 D D + D2 D2 + DD + D2 D3 Since dmm = 0, all matrices to first power in D have a vanishing trace. By computing the product of the matrices, we find that Q ¢ ¡ ¢ X ¡ g2n trace D2 = trace (DD) = trace D2 = n=1
Hence, Q Q X ¡ ¢ X ¡ ¢ trace T3 = g3n + 3 g2n trace D3 n=1
n=1
where Q Q X Q Q X X ¡ ¢ X dmn dno dom = 3n trace D3 = m=1 n=1 o=1
n=1
¡ ¢ and (3.3) shows that trace D3 equals six times the number of triangles in the graph, which we denote by NJ . Combining all yields Q X n=1
3n =
Q X n=1
g3n + 3
Q X
g2n 6NJ
(4.6)
n=1
¡ ¢ P 2 For the complete graph, we have that trace D3 = Q (Q 1) (Q 2) and Q n=1 gn = 2 Q (Q 1) such that, for Q A 3, 3
Q X
g2n 6NJ = 3Q (Q 1) (3 Q ) ? 0
n=1 1
Each of the values 1 > 2 > = = = > Q is interpreted as a realization (outcome) of the random 1 SQ p variable and the mean of the p-th powers is computed as H [p ] = Q n=1 n .
Eigenvalues of the Laplacian T PQ while for a tree, where NJ = 0, the last two sums are 3 n=1 g2n 6NJ A 0. Thus, the sum of the third powers of the Laplacian eigenvalues can be lower and higher than the corresponding sum of the degrees. Stochastically, the third centered moment, which quantifies the skewness of the distribution, follows from (4.6) and (4.4) as h i h i 6NJ H ( H [])3 = H (G H [G])3 + 3Var [G] Q The third centered moment eigenvalue diers from that of the ¡ of the Laplacian ¢ degree G by an amount 3 Var [G] 2NQJ . 70
72. We can extend the previous computation to higher powers and compute, for any integer p 0, p
trace (Tp ) = trace (( D) ) by using the linearity and commutativity of the trace of the matrix product trace (FG) = trace (GF) p
When expanding the product ( D) in a sum of 2p matrix products2 and applying the commutativity of the trace, we find the usual binomial expansion p μ ¶ X ¢ ¡ p (1)pn trace n Dpn trace (( D)p ) = n n=0 ¢ ¡ Since n = diag gn1 > gn2 > = = = > gnQ , we have that Q Q Q X X ¡ ¢ X ¡ n pn ¢ ¡ n ¢ ¡ pn ¢ trace n Dpn = D ot D = oo to o=1 t=1
o=1
=
Q X
¡ ¢ gno Dpn oo
o=1
and trace (Tp ) =
p μ ¶ X p n=0
n
(1)pn
Q X
¡ ¢ gno Dpn oo
o=1
Taking into account that Doo = 0, we can express, using (8.20), the p-th moment of the Laplacian ¡ ¢ eigenvalues in terms of the degree sequence and the number of closed walks Dm oo of length m starting and returning at node o (art. 17), as μ ¶X Q Q p2 X μp¶ X ¡ ¢ p pn (1) gp1 + gno Dpn oo +(1)p Zp o n 2 n=1 o=1 o=1 n=1 o=1 (4.7) ¡ ¢ where we have introduced Zn = trace Dn as defined in art. 36. Q X
2
p n =
Q X
gp o +
Each product can be associated with a binary expression of a number 0 $ m $ 2p , in which a zero bit is replaced by the matrix { and a one bit by the matrix D.
4.1 General properties
71
73. Art. 158 relates the diagonal elements of a symmetric matrix to its eigenvalues and so provides another relation between the degree gm of node m and the set of Laplacian eigenvalues 0 = Q Q1 · · · 1 . The matrix equation (8.35) becomes \ = g, where the vector =£(1 > 2 > = = = > Q ), g = ¤ (g1 > g2 > = = = > gQ ) W and where the non-negative matrix \ consists of col= | · · · | | 1 2 Q ¢ ¡ umn vectors |m = {21m > {22m > = = = > {2Q m , where {nm is the m-th component of the n-th eigenvector of T belonging to n . Analogously to the adjacency matrix in art. 32, also for the Laplacian the determinant is singular, det \ = 0. This follows from (8.37) and the fact that |Q = Q1 x, because the sum of the first Q 1 columns in \ W is a multiple of the last column. Hence, beside the largest eigenvalue at 1, \ (and \ W ) has also a zero eigenvalue. The obvious consequence is that \ = g cannot be inverted to g = \ 1 . However, when deleting the last column and last row, the resulting matrix \˜ (minor of \ ) can be inverted and the degrees g1 > g2 > = = = > gQ 1 can be determined. The degree gQ of the Q -th node then follows from the basic law (2.3). 74. If J is regular, where all nodes have the same degree, gm = u for all 1 m Q , then the eigenvalues of the Laplacian T and the adjacency matrix D are directly connected because det (T L) = det ((u ) L D). Thus, for all 1 m Q , m (T) = u Q+1m (D)
(4.8)
Since Q (T) = 0, we again find as in art. 41 that the largest eigenvalue of the adjacency matrix in a regular graph equals 1 (D) = u. From (4.8), the dierence for all 1 m Q , m1 (T) m (T) = Q+1m (D) Q +2m (D) shows that the spectral gap (art. 55) in a regular graph equals 1 (D) 2 (D) = Q 1 (T). This relation might suggest that the spectral gap in any graph is related to the second smallest eigenvalue Q 1 of the Laplacian, whose properties are further explored in Section 4.2. However, Section 7.5.2 exhibits a graph with large spectral gap and small Q1 . 75. A direct application of Lemma 8 to D = T yields, for any eigenvalue 1 n Q, gmin n (T) n (D) gmax n (T) and g(n) 1 (D) n (T) g(n) Q (D) Equality is only reached when gmin = gmax = u as in a regular graph (art. 74). 76. The Laplacian spectrum of the complement Jf of J. From the adjacency matrix Df = M L D of the complement Jf of a graph J (art. 1), the Laplacian
Eigenvalues of the Laplacian T
72
of the complement Jf is immediate as Tf = f Df = (Q 1) L M + L + D = QL M T Let {1 > {2 > = = = > {Q = x denote the eigenvectors of T belonging to the eigenvalues Q 1 1 > 2 > = = =, and Q = 0, respectively. The eigenvalues of M are Q and [0] as shown in (5.1). Since Mx = Q x and M{m = 0 for 1 m Q 1 as demonstrated in art. 85, we observe that Tf x = 0 and Tf {m = (Q m ) {m Hence, the set of eigenvectors of T and of the complement Tf are the same, while the ordered eigenvalues, for 1 m Q 1, are m (Tf ) = Q Q m (T)
(4.9)
Art. 66, and alternatively also art. 68, indicate that all eigenvalues of a Laplacian matrix are non-negative, hence m (Tf ) 0 for all 1 m Q such that (4.9) then implies that Q Q m (T) 0, or that all Laplacian eigenvalues must lie in the interval [0> Q ]. Hence, the upper bound for 1 in art. 68 needs to be refined to 1 min (Q> 2gmax )
(4.10)
77. The Rayleigh’s inequalities in art. 152 us to consider the quadratic ¡ motivate ¢ form (4.1) further. The o-th component of E W { o = {l {m where the link o = l $ m connects node l and m, starting at node l = o+ and ending at node m = o . This observation allows us to write ° °2 X 2 {W T{ = °E W {°2 = ({o+ {o ) (4.11) o5L
Since the vector { consists of any real number, we may consider { as a real function i (q) acting on a node q. Thus, with {o+ = i (o+ ) and {o = i (o ), we finally arrive at X¡ ¡ ¢ ¡ ¢¢2 (Ti> i ) = i o+ i o P
o5L
where (j> i ) = {5N i ({) j ({) denotes the scalar product (art. 241) of two real functions i and j belonging to O2 (N ), the space of all real functions on the set of 2 nodes N for which the norm ki k = (i> i ) exists. 78. Art. 67 shows that the eigenvector { of T belonging to Q 1 must satisfy {W x = 0. By requiring this additional constraint and choosing the scaling of the
4.1 General properties
73
eigenvector such that {W { = 1, Rayleigh’s principle (art. 152) applied to the second smallest eigenvalue of the Laplacian results in Q 1 =
min
k{k22 =1 and {W x=0
{W T{
(4.12)
Applied to the complement Tf and with (4.9), we obtain Q 1 (Tf ) = Q 1 (T) =
min
k{k22 =1 and {W x=0
{W Tf {
Since {W Tf { = {W (Q L M T) { = Q {W T{ as follows from art. 76, we obtain that ¡ ¢ W Q { Q 1 (T) = min T{ = Q 2 max {W T{ 2 k{k2 =1 and {W x=0
k{k2 =1 and {W x=0
Hence, the largest eigenvalue of T obeys 1 (T) =
max
k{k22 =1 and {W x=0
{W T{ = Q Q1 (Tf )
4.1.1 Eigenvalues and connectivity 79. Disconnectivity is a special case of the reducibility of a matrix (art. 167) and expresses that no communication is possible between two nodes in a dierent component or cluster. A component of a graph J is a connected subgraph of J. Theorem 10 The graph J is connected if and only if Q 1 A 0. Proof: The theorem is a consequence of the Perron-Frobenius Theorem 38 for a non-negative, irreducible matrix. Indeed, consider the non-negative matrix L T, where gmax . If J is connected, then L T is irreducible and the Perron-Frobenius Theorem 38 states that the largest eigenvalue u of L T is positive and simple and the corresponding eigenvector {u has positive components. Hence, T{u = ( u) {u . Since eigenvectors of a symmetric matrix are orthogonal (art. 151) while xW {u A 0, {u must be proportional to x, and thus Q = u = 0. Since there is only one such eigenvector {u and since the eigenvalue u exceeds all others, all other eigenvalues of T must exceed zero. ¤ 80. A graph J has n components (or clusters) if there exists a relabeling of the nodes such that the adjacency matrix has the structure 5 6 D1 R = = = R 9 .. : 9 R D2 . : 9 : D=9 . : .. 7 .. 8 . R = = = Dn
74
Eigenvalues of the Laplacian T
where the square submatrix Dp is the adjacency matrix of the connected component p. The corresponding Laplacian is 5 6 T1 R = = = R 9 .. : 9 R T2 . : : T=9 9 . : .. 7 .. 8 . R
= = = Tn
Using (8.79) indicates that det (T L) =
n Y
det (Tp p L)
p=1
Since each block matrix Tp is a Laplacian, whose row sum is zero and det Tp = 0, the characteristic polynomial det (T L) has at least a n-fold zero eigenvalue. If each block matrix Tp is irreducible, i.e., the p-th cluster is connected, Theorem 10 shows that Tp has only one zero eigenvalue. Hence, we have proved: Theorem 11 The multiplicity of the smallest eigenvalue = 0 of the Laplacian T is equal to the number of components in the graph J. If T has only one zero eigenvalue with corresponding eigenvector x (art. 66), then the graph is connected; it has only one component. Theorem 11 as well as Theorem 10 also imply that, if the second smallest eigenvalue Q 1 of T is zero, the graph J is disconnected.
4.1.2 The number of spanning trees and the Laplacian T 81. Matrix Tree Theorem. The coe!cients {fn (T)}0nQ of the characteristic polynomial of the Laplacian fT ({) = det (T {L) =
Q X
fn (T) {n
n=0
can be expressed in terms of sums over minors (see art. 138). Apart from fQ = (1)Q , we apply (8.4) for 0 p ? Q to the Laplacian T = EE W X ¡ ¢ X ¢ ¢ ¡¡ (1)Q p fQp (T) = minorp EE W = det EE W p doo
doo
¢ ¡ where (T)p = EE W p denotes an p × p submatrix of T obtained by deleting the ¡ ¢ ¡ Q ¢ same set of Q p rows and columns and where the sum is of over all Q p = Q p ways in which Q p rows can be deleted among the Q rows. Since T = EE W and PO tlm = n=1 eln emn , deleting a row l in T translates to deleting row l in E. Thus, (E)p is an p × O submatrix of E in which the same Q p rows in E are deleted.
4.1 General properties 75 ¢ ¡ We apply the Binet-Cauchy Theorem 45 to det EE W p . Using (8.85) gives ¯ ¯ ¯ e1n1 · · · e1np ¯2 ¯ ¯ ¢ ¡ ¯ .. .. ¯ det EE W p = ··· ¯ . ··· . ¯¯ ¯ n1 =1 n2 =n1 +1 np =np1 +1 ¯ epn1 · · · epnp ¯ ¢ ¡ which illustrates that det EE W p is non-zero so that fT ({) is a polynomial with positive coe!cients. Descartes’ rule (art. 212) shows that fT ({) has no real positive zero, agreeing with the non-negativity of the Laplacian eigenvalues (art. 66). Poincaré’s Theorem 2 tells us that the square of the above determinant in the multiple sum is either zero or one. It remains to investigate for which set (n1 > n2 > = = = > np ) the determinant is non-zero, hence, of rank p. Art. 6 shows that, only if the subgraph formed by the p links (columns in the matrix of the above determinant) is a spanning ¡ ¢ tree, the determinant is non-zero. To conclude, det EE W p equals the total number of trees with p links that can be formed in the graph on p + 1 given nodes. The coe!cient (1)Qp fQ p (T) then counts all these spanning trees with p links over all possible ways of deleting Q p nodes in the graph. In summary, we have demonstrated the famous Matrix Tree Theorem: O X
O X
O X
Theorem 12 (Matrix Tree Theorem) In a graph J with Q nodes, the coe!cient (1)Q p fQp (T) of the characteristic polynomial of the Laplacian T equals the number of all spanning trees with p links in all subgraphs of J that are obtained after deleting Q p nodes in all possible ways. Clearly, f0 (T) = det T = 0 because there does not exist a tree with Q links that spans the Q nodes in a graph. The other extreme is, by convention, (1)Q fQ (T) = 1. Further, (1)Q 1 fQ 1 (T) = 2O, equals the number of spanning trees in J each consisting which equals twice the number of links in J. In¡ ¢of onePlink, O W deed, det EE 1 = n1 =1 |e1n1 | is the number of neighbors of node 1; taking Q 1 the sum over all possible ways to delete one row results in (1) fQ 1 (T) = PQ PO l=1 nl =1 |elnl |, which is the sum of the absolute value of all elements in E. This result also follows from the general relation (8.7) for the second highest degree coe!cient ¡ ¢in any polynomial and art. 69. When p = Q 1, art. 6 shows that det EE W Q1 equals the number of all spanning trees with Q 1 links in the graph J. Since there are precisely Q ways to remove one node (one row in E), the coe!cient f1 counts Q times all trees spanning all Q nodes in J. The characteristic polynomial of the Laplacian of the example graph in Fig. 2.1 is fT ({) = {6 18{5 + 125{4 416{3 + 659{2 396{ Ã Ã s !Ã s ! s !Ã s ! 7 13 7 5 7+ 5 7 + 14 ={ { { ({ 4) { { 2 2 2 2
Eigenvalues of the Laplacian T
76
The example graph has 18 spanning trees with one link, 125 consisting of two links, . . . , and 66 spanning trees with five links (396 = 6 × 66). There is another Matrix Tree Theorem variant for the coe!cients of the characteristic polynomial of T due to Kelmans and Chelnokov (1974) based on the notion of a forest. A forest is a collection of trees. A n-forest, denoted by In , is a forest consisting of n components and a 1-forest is a tree. A component m is a set Nm of nodes of J and two dierent components possess dierent nodes such that Nm _ No = B for each component m and o of a n-forest. A n-spanning forest of J is a n-forest whose union of components consists of all nodes of J, thus ^no=1 No = N , and a n-spanning forest of J has Q n links. Two n-spanning forests are dierent Qn if they have dierent sets of links. Finally, we denote by (In ) = o=1 qo , where qo = |No |. Theorem 13 (Matrix Tree Theorem according to Kelmans) In a graph J with Q nodes, the coe!cient (1)p fp (T) of the characteristic polynomial of the Laplacian T equals, for p = 0, f0 = 0 and, for 1 p Q , X (Ip ) (1)p fp (T) = al l Ip
where the sum is over all possible p-spanning forests of the graph J with precisely p components. Kelmans Theorem 13 is used in art. 87. Kelmans and Chelnokov (1974) also give3 1X 2 gn 2 Q
(1)Q 2 fQ 2 (T) = 2O2 O
n=1
(1)
Q 3
fQ 3 (T) =
X 4 3 1X 3 O 2O2 (O 1) g2n + gn 2NJ 3 3 Q
Q
n=1
n=1
where NJ is the number of triangles in J. Invoking the Newton identities in art. 198, we may verify that these expressions for the coe!cients fn (T) are consistent with (4.4) and (4.6).
4.1.3 The complexity 82. The complexity (J) of the graph J equals the number of all possible spanning trees in the graph. Let M denote the all-one matrix with (M)lm = 1 and M = x=xW , then adjT = (J) M 3
(4.13)
The first result is presented without proof, but a reference to the Russian PhD thesis of Kelmans is given, while the second result is obtained by using special types of graphs.
4.1 General properties
77
adj[ where [ 1 = det [ . Indeed, if rank(T) ? Q 1, then every cofactor of T is zero, thus adjT = 0 and (4.13) shows that (J) = 0 implying that the graph is disconnected. If rank(T) = Q 1, then TadjT = L det T = 0 which means that each column vector of adjT is orthogonal to the Q 1 dimensional space spanned by the row vectors of T. Thus, each column vector of adjT belongs to the null-space or kernel of T, which is one-dimensional and spanned by x, since Tx = 0. Hence, each column vector of adjT is a multiple of the vector x. Since T is symmetric, so is adjT ³and all the ´ multipliers must be equal such that adjT = M. Since ¡ ¢ adjT = det EE W Q 1 , the Matrix Tree Theorem 12 in art. 81 shows that (J) equals the total number of trees that span Q nodes. We apply the relation (4.13) to the complete graph NQ where T = Q L M. Equation (4.13) demonstrates that all elements of adjT are equal to (J). Hence, it su!ces to compute one suitable element of adjT, for example, (adjT)11 , which is equal to the determinant of the (Q 1)×(Q 1) principal submatrix of T obtained by deleting the first row and column in T,
5 9 9 (adjT)11 = det 9 7
Q 1 1 === 1 1 Q 1 === 1 .. .. .. . . . 1 1 === Q 1
6 : : : 8
Adding all rows to the first and subsequently adding this new first row to all other rows gives 5 9 9 (adjT)11 = det 9 7
1 31 .. . 31
1 Q 31 31
=== === .. . ===
1 31 .. . Q 31
6
5
: 9 : 9 : = det 9 8 7
1 0 .. . 0
1 Q 0
=== === .. . ===
1 0 .. . Q
6 : : Q 32 :=Q 8
Hence, the total number of spanning trees in the complete graph NQ , which is also the total number of possible spanning trees in any graph with Q nodes, equals Q Q2 . This is a famous theorem of Cayley of which many proofs exist, see, e.g., Lovász (2003) and van Lint and Wilson (1996, Chapter 2). 83. Equation (4.13) shows that all Q minors PQ 1 of T are equal to (J). Application of the general relation (8.4) for the coe!cients of the characteristic polynomial then gives f1 = Q (J), as earlier established in art. 81. Using (8.8) QQ 1 and the fact that Q = 0 (see art. 66) yields f1 = m=1 m . By combining both, the total number of spanning trees (J) in a connected graph is expressed in terms of the eigenvalues of the Laplacian T as (J) =
Q 1 1 Y m Q m=1
(4.14)
Eigenvalues of the Laplacian T
78
84. The complexity of J is also given by (J) =
det (M + T) Q2
(4.15)
Indeed, observe that MT = (ME) E W = 0 since ME = 0 as follows from M = x=xW and from (2.1) in art. 1. Hence, (Q L M) (M + T) = Q M + Q T M 2 MT = Q T and adj ((Q L M) (M + T)) = adj (M + T) adj (Q L M) = adj (Q T) Since TNQ = Q L M and as shown in art. 82, adj(Q L M) = Q Q 2 M and since adj(Q T) = Q Q1 adjT = Q Q1 (J) M, where we have used (4.13), adj (M + T) M = Q (J) M Left-multiplication with M + T taking into account that MT = 0 and M 2 = Q M finally gives (M + T) adj (M + T) M = det (M + T) M = Q 2 (J) M which proves (4.15). 85. Since Tx = 0, we also have that TM = R and, after taking the transpose, M W TW = MT = R. Hence, the Laplacian T = D commutes with the all-one matrix M, TM = MT. Recall from art. 41 that the adjacency matrix D and the all-one matrix M only commute if the graph is regular. Since commuting matrices have a common, not necessarily complete set of eigenvectors on Lemma 11, T and M have a common basis of eigenvectors. The all-one vector x is also an eigenvector of M with eigenvalue (M) = Q . All eigenvalues (5.1) of the rank 1 symmetric matrix M = x=xW are explicitly known. If [ is the matrix containing as columns the eigenvectors m1 = x> m2 > = = = > mQ of M and [ W [ = L, then diag(n (T)) = [ W T[. The matrix \ = L Q1 M projects any other vector { orthogonal to the vector x. Hence, a set of eigenvectors of M consists of Q 1 columns of \ and the vector x. However, there are infinitely many sets of basisvectors that are also eigenvectors of M, but not necessarily of T. Hence, the di!culty lies in finding [T among all those of [M . 86. Vice versa, if {n is an eigenvector of T belonging to n A 0, then it is also an eigenvector of M because M{n = 0 for any {n orthogonal to x. This means that the eigenvalues of M + T consists of the eigenvalue Q with eigenvector x and the set 0 ? m > m1 > = = = > 1 where m Q 1. If m = Q 1, Theorem 11 shows that the graph is connected, else the graph is disconnected. A connected graph satisfies Q det (M + T) = Q Q1 m=1 m and the complexity via (4.15) leads again to (4.14). If Ju is a regular graph where all nodes have degree u, then art. 74 shows that
4.1 General properties
79
m = u Q+1m . Substituted in (4.14) yields (Ju ) = Q
1
Q1 Y
(u Q+1m ) = Q
Q Y
1
(u p )
p=2
m=1
The characteristic polynomial fDu ({) of the adjacency matrix of Ju equals fDu ({) = ({ u)
Q Y
({ p )
p=2
from which we deduce that ¯ Q Y gfDu ({) ¯¯ = (u p ) = Q (Ju ) g{ ¯{=u p=2 87. Since f0 = det T = 0, the characteristic polynomial of the Laplacian is fT ({) = {
Q 1 X
fn+1 (T) {n
n=0
Applying the Newton equations (art. 198) to Q 1 X n=1
fT ({) {
gives
f2 (T) 1 = n f1 (T)
PQ1
Since all zeros of n=0 fn+1 (T) {n for a connected graph are positive and 2O (art. 81), art. 198 provides the bound
fQ 1 fQ
=
2
f2 (T) (Q 1) f1 (T) 2O
Art. 83 shows that f1 (T) = Q (J), while the Matrix Tree Theorem 12 in art. 81 indicates that f2 (T) equals the number of all spanning trees with Q 2 links in all subgraphs of J that are obtained after deleting any pair of two nodes in J. For a tree J = W , we have that (J) = 1 and f1 (T) = Q , while Kelmans’ Theorem 13 states that X f2 (T) = (I2 ) all I2
where the sum is over all possible 2-spanning forests of the graph J with precisely two components. A 2-spanning forest is constructed from a spanning tree of J in which one link is deleted such that two disjoint trees W1 and W2 are obtained. Now, (I2 ) = q1 q2 is also equal to the number of ways of choosing a node y1 in tree W1 (component 1) and a node y2 in W2 (component 2). Since J is a tree, the number of pairs (W1 > y1 ) and (W2 > y2 ) equals the distance k (y1 > y2 ) in hops between node y1
80
Eigenvalues of the Laplacian T
and node y2 , since (W1 > y1 ) and (W2 > y2 ) can only be obtained by deleting one of the links in J on the path from y1 to y2 . Thus, X X Q (Q 1) H [KW ] f2 (T) = k (y1 > y2 ) = 2 y1 5N y2 6=y1 5N
where KW is the hopcount in the tree W . Hence, the average hopcount in any tree satisfies Q 1 2 X 1 (4.16) H [KW ] = Q 1 n n=1
Mohar (1991) has attributed formula (4.16) to Brendan McKay, who provided the above derivation. Section 7.8.3 demonstrates, via inequality (7.26), that the righthand side of (4.16) is a lower bound for the average hopcount in any graph.
4.2 Second smallest eigenvalue of the Laplacian T The second smallest eigenvalue Q1 of the Laplacian has many interesting properties and was coined by Fiedler (1973), the algebraic connectivity of a graph. Mainly bounds are presented in this section, whereas art. 97 provides the major motivation to focus in depth on the algebraic connectivity Q 1 .
4.2.1 Upper bounds for Q1 88. The eigenvector belonging to the smallest, zero eigenvalue Q is x (art. 66). In the terminology of art. 77 and art. 241, any constant function i ({) = f is an eigenfunction of Q . Rayleigh’s theorem (art. 152) states that, for any function i orthogonal to a constant function f, we have Q1 (i> i ) (Ti> i ) and the minimizer, for which equality holds, is the eigenfunction belonging to the second smallest eigenvalue Q 1 . With art. 77, we obtain P 2 (i (o+ ) i (o )) (4.17) Q 1 o5LP 2 q5N i (q) P for any i that satisfies (i> f) = f q5N i (q) = 0. The latter condition is always P fulfilled if we choose i ({) = j ({) Q1 q5N j (q), where the last term can be interpreted as an average of j over all nodes of the graph. In addition, for such a choice, (i (o+ ) i (o )) = (j (o+ ) j (o )) such that P + 2 o5L (j (o ) j (o )) Q 1 P ¡ ¢2 P 1 2 q5N j (q) Q x5N j (x) for any non-constant function j.
4.2 Second smallest eigenvalue of the Laplacian T
81
For example, choose the vector or eigenfunction i as i (x) = 1, i (y) = 1 and i (q) = 0 for any node q 6= y 6= x. This vector is orthogonal to the constant, (i> f) = 0. Inequality (4.17) then gives Q1
gx + gy 2
A sharper bound using the same method is obtained in (4.20). 89. There is an alternative representation for (i> i ) or for {W { = k{k22 due to Fiedler. Since, Q Q X X l=1 m=1
2
({l {m ) =
Q Q X X
{2l + 2
l=1 m=1
Q X
{l
l=1
¡ ¢2 = 2Q {W { + 2 xW {
Q X
{m +
m=1
Q Q X X
{2m
l=1 m=1
and since any eigenvector { that does not belong to Q = 0 is orthogonal to x, we find that Q Q 1 XX {W { = ({l {m )2 2Q l=1 m=1 Thus, if i is the eigenfunction of T belonging to Q 1 , then P 2 2Q o5L (i (o+ ) i (o )) Q1 = P P 2 x5N y5N (i (x) i (y))
(4.18)
The numerator and denominator are invariant to the addition of a constant. If i is not the eigenfunction of T belonging to Q 1 , i.e., i 6= f, Rayleigh’s principle in art. 152 states that P 2 2Q o5L (i (o+ ) i (o )) Q1 P (4.19) P 2 x5N y5N (i (x) i (y)) The advantage of this inequality is, that explicit orthogonality for i to the constant function f, (f> i ) = 0, is not required anymore since it is implicitly incorporated into the denominator. For example, choosing now the eigenfunction i as i ({) = 1{{=z} leads, with (i (x) i (y))2 = 1{x=z} + 1{y=z} provided x 6= y and X X X X X X (i (x) i (y))2 = 1{x=z} + 1{y=z} x5N y5N
x5N y5N \{x}
=2
X
1{x=z}
x5N
X
y5N x5N \{y}
1 = 2 (Q 1)
y5N \{x}
to Q1
Q gz Q 1
Since the inequality holds for any node z, the sharpest bound is reached when
Eigenvalues of the Laplacian T
82
gz = gmin and we find an inequality for the second smallest eigenvalue of the Laplacian Q Q 1 gmin (4.20) Q 1 Since equality is attained for the complete graph NQ as shown in Section 5.1, the bound (4.20) is generally the best possible. Recall that this inequality also follows from (8.62) in Fiedler’s Theorem 41 for symmetric, positive semidefinite matrices. The bound (4.20) is also derived from the Alon-Milman inequality (4.33) as shown in art. 97. 90. We apply (4.20) to the complement Jf of a graph J, Q Q gmin (Jf ) = (Q 1 gmax (J)) Q 1 Q 1 Q gmax (J) =Q Q 1
Q 1 (Tf )
Using (4.9) yields a lower bound for the largest eigenvalue of the Laplacian Q gmax 1 min (Q> 2gmax ) Q 1
(4.21)
where the upperbound follows from (4.10). Grone and Merris (1994) succeeded in improving Fiedler’s lower bound (4.21). Since their proof is not illuminating, however, we merely quote the improved lower bound, 1 gmax + 1
(4.22)
which they claim is a strict inequality when gmax ? Q 1. Applying (4.22) to the complement Jf then shows that 1 (Tf ) gmax (Jf ) + 1 = Q gmin (J) and, with (4.9), that Q 1 (T) gmin (J)
(4.23)
4.2.2 Lower bounds for Q 1 91. Lower bounds for any Laplacian eigenvalue. Recently, Bouwer and Haemers (2008) have impressively extended the type of lower bound (4.22) of Grone and Merris. Theorem 14 (Brouwer and Haemers) For any graph but Np + (Q p) N1 , the disjoint union of the complete graph Np and Q p isolated nodes, the m-th largest Laplacian eigenvalue is lower bounded, for 1 m Q , by m g(m) m + 2
(4.24)
4.2 Second smallest eigenvalue of the Laplacian T
83
where g(m) is the m-th largest nodal degree. Proof: The proof of Bouwer and Haemers (2008) cleverly combines the generalized interlacing Theorem 43 applied to a specific quotient matrix N , defined in art. 15. The proof is rather complex and thus omitted. ¤ Bouwer and Haemers (2008) also discuss graphs for which equality in (4.24) is reached. Since m 0, the bound (4.24) becomes useless when g(m) ? m 2. In fact, we may introduce slack variables m 0 in (4.24) to obtain the equality m = g(m) m + 2 + m Substitution into the p-th moment formula (4.7) specifies the moments PQ P For example, for p = 1, we find from (4.2), using Q m=1 g(m) = m=1 gm , Q X m=1
m =
PQ
p m=1 m .
Q (Q 3) 2
which shows that the average of the m ’s increases linearly with Q . The cases for higher values of p are more involved, as illustrated for p = 2, which is derived from (4.4), ¢ ¡ Q Q Q Q X X X X Q 2Q 2 9Q + 13 2 + 2O + 2 m = g2m + 2 m (m gm ) 2 gm m 6 m=1 m=1 m=1 m=1 The last sum is related to the covariance H [G] H [G] H [] and, in general, di!cult to assess. The above method of equating moments (see also art. 246) suggests to consider m = g(m) + ˜m , where the dierence ˜m can be negative as well as positive, but the average dierence is zero. 92. Lower bounds for Q 1 . First, the upperbound (4.10) applied to the complement Jf , 1 (Tf ) 2gmax (Jf ) = 2 (Q 1 gmin (J)) > and (4.9) give Q + 2 + 2gmin (J) Q 1 which is, in most cases, useless if the left-hand side is negative. Hence, more ingenious methods are needed. We will now apply the functional framework of art. 77 and art. 88 to derive a better lower bound for the second smallest eigenvalue of the Laplacian. Assume that i is the eigenfunction of T belonging to Q1 for which the equality sign holds in (4.17), P 2 (i (o+ ) i (o )) Q 1 = o5LP 2 q5N i (q)
Eigenvalues of the Laplacian T
84
Let node x for which |i (x)| = maxq5N |i (q)| A 0. Clearly, X i 2 (q) Q i 2 (x) q5N
P
Since q5N i (q) = 0 as shown in art. 88, there exists a node y for which i (x) i (y) ? 0. Since Q 1 A 0 provided the graph is connected, it means that there exists a path P (y> x) from y to x with hopcount k (P). The minimum number of links to connect a graph occurs in a minimum spanning tree (MST) consisting of Q 1 links. Only if the diameter k (P) of J is smaller than Q 1, we have a strict inequality in X¡ ¡ ¢ X ¡ ¡ ¢ X ¡ ¡ ¢ ¡ ¢¢2 ¡ ¢¢2 ¡ ¢¢2 i o+ i o i o + i o i o+ i o o5L
o5M ST
o5P(y>x)
By the Cauchy-Schwarz inequality (8.41), we have 3 X X ¡ ¡ ¢ ¡ ¢¢ 2 i o+ i o k (P) C o5P(y>x)
42 ¯ ¡ +¢ ¡ ¢¯ ¯i o i o ¯D
o5P(y>x)
3 C
42 ¡ ¡ +¢ ¡ ¢¢ D i o i o
X
o5P(y>x) 2
= (i (y) i (x)) i 2 (x) because i (x) i (y) ? 0. Thus, X o5P(y>x)
¡ ¡ +¢ ¡ ¢¢2 i 2 (x) i 2 (x) i o i o k (P)
Combining all inequalities leads to Q1
1 Q
This bound can only be improved a little by using the definition (4.18). Indeed, using the above inequality based on the Cauchy-Schwarz inequality, we have X X X X X ¡ ¡ ¢ ¡ ¢¢2 i o+ i o (i (x) i (y))2 k (P (y> x)) x5N y5N
x5N y5N
=
X X
x5N y5N
o5P(y>x)
X¡ ¡ ¢ ¡ ¢¢2 i o+ i o k (P (y> x)) 1{o5P(y>x)} o5L
X¡ ¡ ¢ ¡ ¢¢2 X X i o+ i o = k (P (y> x)) 1{o5P(y>x)} o5L
x5N y5N
X¡ ¡ ¢ ¡ ¢¢2 X X i o+ i o 1{o5P(y>x)} o5L
x5N y5N
4.2 Second smallest eigenvalue of the Laplacian T
85
where the betweenness of a link o is defined as 1 X X 1{o5P(y>x)} Eo = 2 x5N y5N
Art. 53 shows that the number of links in the union ofh alli shortest hop paths 2 between a same source x and destination y is at most Q4 . This means that h 2i an arbitrary link o can only occur in at most Q4 unions4 of shortest hop paths between all pairs (x> y), 2¸ X X Q (4.25) 2Eo = 1{o5P(y>x)} 2 4 x5N y5N
Thus, (4.18) leads to Q1
4 Q
(4.26)
This lower bound (4.26) is the best possible. As mentioned by Mohar (1991), McKay has shown that in a tree of diameter = w + 2, obtained from a w-hop path, where n nodes are connected to each of its end-nodes such that Q = w + 1 + 2n, (4.26) is sharp if nw $ 4. 93. We present another interpretation, deduced from art. 92, by rewriting X X u= k (P (y> x)) 1{o5P(y>x)} x5N y5N
=
X X
¡ ¢ k (P (y> x)) 1{o5P(y>x)} 1 + 1
x5N y5N
=
X X
k (P (y> x))
X
X
¢ ¡ k (P (y> x)) 1 1{o5P(y>x)}
x5N y5N \{x}
x5N y5N
because k (P (x> x)) = 0. In all other cases where nodes x and y are dierent, k (P (y> x)) 1, such that the last sum is bounded: X X ¢ ¡ ue = k (P (y> x)) 1 1{o5P(y>x)} x5N y5N \{x}
X
X
x5N y5N \{x}
μ ¶ X ¡ ¢ Q 1 1{o5P(y>x)} = 2 2
X
1{o5P(y>x)}
x5N y5N \{x}
μ ¶ Q2 Q (Q 2) Q = 2 2 4 2 2
where in the last line (4.25) has been used. With the definition of the average hopcount, X X k (P (y> x)) = Q (Q 1) H [K] x5N y5N 4
k The maximum betweenness in any graph, Eo $ by Wang et al. (2008).
Q2 4
l , can also be proved dierently, as shown
Eigenvalues of the Laplacian T
86 we thus find X X
k (P (y> x)) 1{o5P(y>x)} Q (Q 1) H [K]
x5N y5N
Q (Q 2) 2
Again, (4.18) shows that Q 1
2 (Q 1) H [K]
(Q 2) 2
or H [K]
(Q 2) 2 + (Q 1)Q1 2 (Q 1)
94. Another type lower bounds for Q 1 . Let i be the eigenfunction of T belonging to Q 1 . Since i is non-zero and orthogonal to the constant function, X ¯ ¡ ¢¯ X ¡ ¢ X ¯i q ¯ i (q) = i q+ 0= q+ 5N
q5N
q 5N
where, for q+ 5 N , i (q+ ) A 0 and q 5 N , i (q ) 0. Let us define the set of positive nodes N + = {q 5 N : i (q) A 0} and N = N \N + . Similarly, let L+ = {x+ y + 5 N : x+ > y + 5 N + } denote the set of all links between positive nodes and L = {x+ y 5 N : x+ 5 N + > y 5 N } denote the set of all links between positive nodes and negative nodes. Since i is an eigenfunction of T, for each nodal component x 5 N holds that (Ti ) (x) = Q1 i (x) Multiplying both sides by i (x) and summing over positive nodes yields P + Ti (y) i (y) P Q1 = y5N 2 y5N + i (y) Using the definition (art. 2) of the Laplacian T = D, X X Ti (y) i (y) = i (y) (i Di ) (y) y5N +
y5N +
X
=
y5N +
X
=
3 i (y) Cg (y) i (y) X
X
4 i (x)D
x5neighb or(y)
i (y) (i (y) i (x))
y5N + x5neighb or(y)
Further, after splitting the neighbors into positive and negative nodes, X X X Ti (y) i (y) = i (y) (i (y) i (x)) + i (y) (i (y) i (x)) y5N +
y + x+ 5L+
y + x 5L
4.2 Second smallest eigenvalue of the Laplacian T
87
Since the graph is bidirectional, i.e., DW = D, the link y+ x+ = x+ y + appears twice in the sum such that X X i (y) (i (y) i (x)) = {i (y) (i (y) i (x)) + i (x) (i (x) i (y))} y + x+ 5L+
x+ y + 5L+
X
=
(i (y) i (x))2
x+ y + 5L+
where a link x+ y+ 5 L+ is only counted once. Similarly as before, we denote the link o = x+ y + by the head of link as o+ = x+ and by the tail as o = y+ . Thus, we arrive at X¡ ¡ ¢ X X ¡ ¢¢2 i o+ i o Ti (y) i (y) = + i (y) (i (y) i (x)) y5N +
o5L+
y + x 5L
and P Q 1 =
2
o5L+
(i (o+ ) i (o )) + P
P
y5N +
y + x 5L i 2 (y)
i (y) (i (y) i (x))
Also the last sum in the numerator is non-negative because each term ¡ ¢¢ ¡ ¢¡ ¡ ¢ i y + i y + i x A 0 such that
X
X
Ti (y) i (y)
y5N +
2
(i (y) i (x))
x+ y+ 5L+
which leads to a lower bound P Q 1
(i (o+ ) i (o )) P 2 q5N + i (q)
2
o5L+
(4.27)
The lower bound (4.27) resembles the upper bound (4.17), except that only positive nodes and links are considered and that i is not arbitrary, but the eigenfunction of T belonging to the eigenvalue Q 1 . We can improve this lower bound (4.27) by incorporating positive terms in P y + x 5L i (y) (i (y) i (x)), that we have neglected. This means that also links outside the positive cluster are taken into account. Following Alon (1986), we can define j (y) = i (y) 1{y5N + } such that X X i (y) (i (y) i (x)) (j (y) j (x))2 y+ x 5L
y + x 5L
With this function, the first sum remains unaltered, X¡ ¡ ¢ X¡ ¡ ¢ ¡ ¢¢2 ¡ ¢¢2 X ¡ ¡ + ¢ ¡ ¢¢2 i o+ i o j o+ j o j o j o = = o5L+
o5L+
o5L
Eigenvalues of the Laplacian T P P 2 2 2 and, also q5N + i (q) = q5N + j (q) = q5N j (q). Thus, the improved lower bound is P + 2 o5L (j (o ) j (o )) P (4.28) Q 1 2 q5N j (q) 88
P
95. Let J + {h} denote a graph obtained from J by adding a link h between two nodes of J. For any i orthogonal to a constant function, we have that P P + 2 + 2 2 (i (h+ ) i (h )) o5L(J+{h}) (i (o ) i (o )) o5L(J) (i (o ) i (o )) P P P = + 2 2 2 q5N i (q) q5N i (q) q5N i (q) If i = iJ+{h} is an eigenfunction of J + {h} corresponding to Q1 (J + {h}), then (4.17) shows that ¡ ¢2 iJ+{h} (h+ ) iJ+{h} (h ) P Q 1 (J + {h}) Q 1 (J) + 2 q5N iJ+{h} (q) On the other hand, if i = iJ is an eigenfunction of J corresponding to Q 1 (J), then 2 (iJ (h+ ) iJ (h )) P Q1 (J + {h}) Q1 (J) + 2 q5N iJ (q) In the first bound, ¡ ¢2 iJ+{h} (h+ ) iJ+{h} (h ) P e= 2 q5N iJ+{h} (q) =
2 2 (h+ ) + iJ+{h} (h ) 2iJ+{h} (h+ ) iJ+{h} (h ) iJ+{h} P 2 2 2 iJ+{h} (h+ ) + iJ+{h} (h ) + q5N \{h+ >h } iJ+{h} (q) ¯ ¯ ¯ ¯ 2 + 2 + ¯¯ ¯ iJ+{h} (h ) + iJ+{h} (h ) + 2 iJ+{h} (h ) iJ+{h} (h )¯ 2 2 iJ+{h} (h+ ) + iJ+{h} (h )
2 | because max{0>|0 {22{| +| 2 = maxu= { 0 the second bound, we arrive at
2u 1+u2
= 1. With
(iJS (h+ )iJ (h ))2 q5N
Q 1 (J) Q 1 (J + {h}) Q 1 (J) + 2
2 (q) iJ
0 in (4.29)
The same bounds (4.29) are elegantly proved by invoking interlacing (art. 183) on TJ+{h} = TJ + T{h} . Indeed, the Laplacian T{hlm } of a link hlm between node l and m has precisely four non-zero elements: tlm¡ = tml = 1 ¢ and tll = tmm = 1. The eigenvalues of T{hlm } are obtained from det T{h} L after expanding the determinant in cofactors over row l (or m), ¡ ¢ 2l Q2 2 Q 2 det T{h} L = (1) () (1 ) (1)l+m (1)m+l () Q 1
= ()
( 2)
4.3 Partitioning of a graph
89
Q 1
and 2; the interlacing inequality (8.72) The eigenvalues of T{hlm } are thus [0] leads to (4.29). Art. 69 shows that, by adding one link, the sum of all eigenvalues increases by 2. Hence, when the upper bound in (4.29) is achieved, all other eigenvalues of TJ+{h} are precisely equal to those of TJ .
4.3 Partitioning of a graph The problem of graph partitioning consists of dividing the nodes of a graph into a number of disjoint groups, also called partitions (see art. 14), such that a certain criterion is met. The most popular criterion is that the number of links between these disjoint groups is minimized. Sometimes, the number of those partitions and their individual size is prescribed. Most, but not all (see art. 96), variants of the graph partitioning problem are NP-hard. 96. Graph partitioning into two disjoint subsets. When confining to a graph partitioning into two disjoint subsets (subgroups, clusters, partitions,...), an index vector | can be defined with vector component |m = 1 if the node m belongs to one partition and |m = 1 if node m belongs to the other partition. The number of links U between the two disjoint subsets, also called the cut size or size of the separator, elegantly follows from the characteristic property (4.11) of the Laplacian, 1 1X 2 U= (|o+ |o ) = | W T| (4.30) 4 4 o5L
because, only if the starting node o+ and the ending node o of a link o belong to a dierent partition, (|o+ |o )2 = 4, else |o+ = |o . The minimum cut size is obviously 1 Umin = min | W T| |5Y 4 where Y is the set of all possible index vectors of the Q -dimensional space with either 1 or 1 components. Since all eigenvectors {{n }1nQ of the Laplacian T are orthogonal (art. 151), PQ any vector can be written as a linear combination. Let | = m=1 m {m , then 1X X m n {Wm T{n U= 4 m=1 Q
Q
n=1
and using the orthogonality property (8.25) in art. 151, we obtain 1X 2 m 4 m=1 m Q
U=
(4.31)
Since Q = 0 and all other eigenvalues are larger than zero for a connected graph
90
Eigenvalues of the Laplacian T
(Theorem 10), the alternative eigenvalue expression (4.31) shows that U is a sum of positive real numbers. Although Stoer and Wagner (1997) have presented a highly ¡ e!cient, non-spectral ¢ min-cut algorithm with a computational complexity of R Q O + Q 2 log Q , which demonstrates that the min-cut problem is not NP-hard, the minimization of (4.31) is generally di!cult. However, if one chooses in (4.30) | = Q 1 {Q 1 , then U = 1 2 4 Q 1 Q 1 , which is, in view of (4.31), obviously the best possible to minimize U. Unfortunately, choosing the index vector | parallel to the Fiedler vector {Q1 is generally not possible, because {Q 1 5 @ Y. A good strategy is to choose the sign of the components in | according to the sign of the corresponding component in the Fiedler vector. A slightly better approach is the choice | = Q x + {Q1 , since the eigenvector x belonging to Q = 0 does not aect the value of U in (4.31) and it provides a higher degree of freedom to choose the size of each partition. This strategy agrees with Fiedler’s graph partitioning explained in art. 103. 97. The Alon-Milman inequality. Another approach to the separator problem is to establish useful bounds. As we will demonstrate here, it turns out that the algebraic connectivity Q 1 plays an important role in such bounds. Our starting point is the upper bound in (4.17) for Q 1 . The ingenuity lies in finding a function i , introduced in art. 88, satisfying (i> f) = 0 that has both a graph interpretation and that provides a tight bound for Q 1 in (4.17). Alon and Milman (1985) have proposed the function μ ¶ 1 1 1 min (k> k (x> D)) j (x) = + d d e k P where (j> f) 6= 0 such that i = j j¯ in art. 88, with j¯ = Q1 q5N j (q). Further, k is the distance (in hops) between two disjoint subsets D and E of N , k (x> D) is the shortest distance of node x 5 N to a node of the set D and d = QQD and e = QQE , where Qn = | Nn | is the number of nodes of set Nn . Clearly, if x 5 D, then j (x) = d1 , while, if x 5 E, then k (x> D) = k and j (x) = 1e . Moreover, if x and y are adjacent, i.e., they are either head (x = o+ ) or tail (x = o ) of a link o, then μ ¶ 1 1 1 + (4.32) |j (x) j (y)| k d e Indeed, if x and y belong to the same set, then j (x)j (y) = 0. If x 5 ¡D and ¢y 5 @ D, then k (y> D) = 1, because x and y are adjacent and j (x) j (y) = d1 + 1e k1 . If both x and y do not belong to D, then |k (y> D) k (x> D)| 1 and μ ¶ 1 1 1 |j (x) j (y)| = + | min (k> k (x> D)) + min (k> k (y> D))| k d e where the dierence of the min-operator is largest and equal to 1 if not both k(x> D) and k (y> D) are larger than k. This proves (4.32). Hence, using this bound (4.32),
4.3 Partitioning of a graph the numerator in (4.17) is X¡ ¡ ¢ ¡ ¢¢2 X ¡ ¡ + ¢ ¡ ¢¢2 i o+ i o j o j o = = o5L
o5L
1 k2
μ
1 1 + d e
91 X
¡ ¡ +¢ ¡ ¢¢2 j o j o
o5L\{D^E}
¶2
(O OD OE )
where OD and OE are the number of links in the sets D and E respectively. The denominator of (4.17) is X X X X 2 2 i 2 (q) i 2 (q) = (j (q) j¯) + (j (q) j¯) q5N
q5(D^E)
q5D
q5E
¶2 ¶2 μ 1 1 j¯ + QE + j¯ = QD d e ¶ ¶ μ μ 1 1 1 1 2 + + (d + e) j¯ Q + =Q d e d e μ
Finally, with (4.17), Alon and Milman (1985) arrive at ¶ μ μ ¶ 1 1 1 1 1 1 Q1 + (O OD OE ) = 2 (O OD OE ) + Q k2 d e k QD QE (4.33) The Alon-Milman inequality (4.33) shows that a large algebraic connectivity Q1 leads to a high number of links between the two clusters D and E. Indeed, consider all subsets D and E in a graph J with a fixed number of nodes QD and QE and same separation k, then a large Q1 implies a large number of links O OD OE between any pair — thus also minimal pairs — of subsets D and E. Hence, a large Q 1 means a higher inter-twined subgraph structure and, consequently, it is more di!cult to cut away a subgraph from J. A graph with large second smallest Laplacian eigenvalue Q 1 is thus more “robust”, in the sense of being better connected or interlinked. Just this property of Q1 has made the second smallest Laplacian eigenvalue a fundamental characterizer of the robustness of a graph. However, the algebraic connectivity Q 1 should not be viewed as a strict disconnectivity or robustness metric. Fig. 4.1 depicts two graphs J1 and J2 , each with Q = 7 nodes, O = 10 links and diameter = 4, but with dierent algebraic connectivity Q1 (J1 ) = 0=6338 and Q 1 (J2 ) = 0=5858. Although Q 1 (J1 ) A Q1 (J2 ), it is easier to disconnect J1 than J2 , because one link removal disconnects J1 , while two links need to be deleted in J2 . 98. Bounds for the separator. The Alon-Milman method of art. 97 can be extended to deduce bounds for the separator V of two disjoint subsets D and E, that are at a distance k from each other. The separator V is the set of nodes at a distance less than k hops from D and not belonging to D nor E, V = {x 5 N \D : k (x> D) ? k} and D ^ E ^ V = N . Sometimes, when k = 1, the separator is called the cut size,
Eigenvalues of the Laplacian T
92
G2
G1
Fig. 4.1. Two graphs J1 and J2 , each with Q = 7 nodes, O = 10 links and diameter = 4, but with dierent algebraic connectivity.
since there is a cut that splits the graph into two partitions. As in art. 97, we define d = QQD , e = QQE and v = QQV , where QF is the number of nodes in the set F. Instead of using the inequality (4.17), Pothen et al. (1990) start from the Fiedler inequality (4.19) in which they use i (x) = 1
2 min (k> k (x> D)) k
that is recognized as the Alon-Milman function j (x) with d¡ = e =¢ 1. If x 5 V, then i (x) = 1 k2 k (x> D) and 1 k2 i (x) 1 2(k1) = 1 k2 . The numerator k in (4.19) is computed precisely as in art. 97 with d = e = 1, μ ¶2 X¡ ¡ ¢ ¡ ¢¢2 2 i o+ i o (O OD OE ) k o5L μ ¶2 2 vQ gmax k The denominator q in (4.19) is 1 X X 2 q= (i (x) i (y)) 2 x5N y5N Ã XX XX XX X = + + + x5D y5V
x5D y5E
x5E y5V
XX
XX
XX
Ã
x5D y5V
+
x5D y5E
+
!
X
! 2
(i (x) i (y))
x5V y5V:yAx
(i (x) i (y))2
x5E y5V
¶¶2 ¶¶2 μ μ μ μ 2 2 2 2 2 1 1 Q dv + (1 (1)) Q de + 1 + 1 Q 2 ev k k μ ¶2 © ª 2 = Q 2 v (d + e) + k2 de k With e = 1 d v, we arrive at Q1
vgmax v (1 v) + d(1 d v)k2
(4.34)
which provides a quadratic inequality in v, from which a lower bound for v can be derived.
4.3 Partitioning of a graph
93
99. Pothen et al. (1990) present another inequality for the normalized size v of the separator, that is a direct application of the Wielandt-Homan inequality (8.75) for symmetric matrices. We can always relabel the nodes in the graph J corresponding to the sets D> E and V such that the Laplacian becomes 5 6 TQd×Q d RQ d×Q e TQ d×Q v TQe×Q e TQe×Qv 8 T = 7 RQ e×Q d W W (TQ d×Q v ) (TQ e×Q v ) TQv×Qv The idea, then, is to consider another matrix, whose eigenvalues are all known, such as P = diag(MQ d×Qd > MQ e×Q e > MQ v×Qv ), where M is the all-one matrix. The eigenvalues of P are those of the separate block matrices, that follow from (5.1) as Q d> Q e> Q f and all the others are zero. Let us assume that d e f. We apply the Wielandt-Homan inequality (8.75) to P and T (to have consistent ordering in the eigenvalues) such that q X n=1
n (T) n (P ) =
q X
Q +1n n (P ) = (0=Q d + Q 1 Q e + Q 2 Q v)
n=1
while trace(TP ) = trace(TP ) and, with the shorter notation for the square matrix UQ o×Q o = UQ o , trace (TP ) = trace (TQd MQd ) + trace (TQe MQ e ) + trace (TQv MQ v ) Ã ! X X X + + = (gx gx ) x5D
x5E
x5V
= 2 (O OD OE OV ) where gx is the number of links incident to the node x and with end node in the same set as x. Substituting both in (8.75) yields Q 1 Q e + Q 2 Q v 2 (O OD OE OV ) 2 (O OD OE ) 2Q vgmax from which, using e = 1 d v, a lower bound for the size of the separator follows as (1 d) Q1 v 2gmax (Q 2 Q1 ) This inequality, that contains beside the algebraic connectivity Q 1 also the gap Q 2 Q 1 , complements the inequality (4.34). 100. Applications of the Alon-Milman bound (4.33). Alon and Milman (1985) mention the following applications of the bound (4.33). First, let D = {x} and E = N \ {x}, then k = 1 and O OD OE = gx , the degree of node x. Since this inequality holds for any node x, the tightest bound is obtained by choosing a node x with minimum degree gmin = minx5N gx , which leads again to (4.20).
Eigenvalues of the Laplacian T
94
Second, let d = e = 12 , then the set of all links connecting a node in D to a node in E is called the bisector of J. The minimum number of the bisector is related to min-cut, max-flow problems. The Alon-Milman bound (4.33) shows a lower bound for the bisector, Q Q1 bisector (J) 4 Third, if k A 1, then every link in the set L\ (LD ^LE ) is incident with at least one of the Q QD QE nodes of the set V = N \ (ND ^N E ), such that OOD OE (Q QD QE ) gmax . The Alon-Milman bound (4.33) becomes, using d + e ? 1, ¶ μ 1 1 1 1 + (1 d e) gmax (1 d e) gmax Q 1 2 k d e dek2 vgmax = d (1 d v) k2 which is clearly weaker than (4.34) because 0 ? v ? 1. It provides a lower bound for the fraction e = QQE as 1d (4.35) e 2 Q 1 1 + dkgmax where k A 1. Based on (4.35), Alon and Milman (1985) also derive a second bound μ r ¸¶ Q 1 e (1 d) exp ln (1 + 2d) k 2gmax
(4.36)
where [{] denotes the largest integer smaller than or equal to {. Proof: The idea is to construct subsets Du of N that include, beside the original subset D, additional nodes of N within distance u 5 R hops from D, i.e., Du = {y 5 N : g (y> D) u}. We construct a sequence on distance u = m for m = 0> 1> = = = > n of those subsets such that Dm and N \D(m+1) are more than k A 1 hops separated, which requires that k A A 1. For those subsets D D D2 · · · Dn N , application of (4.35) yields 1 d(m+1) =
1 dm 1+
dm k2 Q1 gmax
1 dm 2
Q 1 1 + d gmax
The largest possible n is such that n , where is the diameter of the graph. Now, with (4.20), we observe that, for Q 2, 1 Q 1 1 1 Q 1 Q gmin 2gmax such that
2gmax Q 1
A 1. Let 2 =
2gmax Q1
A 1, then
1 d(m+1) (1 dm )
1 1 + 2d
4.3 Partitioning of a graph
95
for 0 m ? n. Multiplying those inequalities yields 1 dn (1 d)
1 (1 + 2d)n
= (1 d)hn ln(1+2d)
and by construction E N \Dn or e ? 1 dn and n ?
q Q 1 = 2g . This max
¤
proves (4.36) for any k ? .
101. Isoperimetric constant . If we choose the set E equal to N \ND , then L LD LE is the set of links with one end in D and the other in E. Thus, CD = O OD OE is the number of links between D and its complement N \ND . The isoperimetric constant of the graph J is defined5 as = min ND
CD QD
(4.37)
£ ¤ where the minimum is over all non-empty subsets ND of N satisfying QD Q2 . The isoperimetric constant is also called the Cheeger constant. The Alon-Milman bound (4.33) reduces (with k = 1) to ¶ μ 1 1 Q 1 CD + QD Q QD ¯ o n CD ¯ Q If we denote n = minND Q ¯ QD = n , then Q1 CD n Qn and this inequality D holds for any set QD , also for the minimizer of the right-hand side. Thus, Q 1 n QQn and Q n Q 1 n Q
£ ¤ We may further minimize both sides over all n = 1> 2> = = = > Q2 . Observe that = min1n[ Q ] n . Hence, the Alon-Milman bound (4.33) leads to a lower bound 2 for the isoperimetric constant Q 1 2 Using Alon’s machinery of art. 94 that led to the lower bound (4.28), Mohar (1989) showed that, for Q A 3, p Q1 (2gmax Q 1 ) 102. Expanders. A graph J with Q nodes is a f-expander if every subset ND £Q ¤ with QD 2 nodes is connected to its complement N \ND by at least fQD links. Since CD fQD , art. 101 indicates that f = . Expanders are thus very di!cult to disconnect because every set of nodes in J is well connected to its complement. This “robustness” property makes expanders highly desirable in the design of fault tolerant networks such as man-made infrastructures like communications networks 5
The computation of the isoperimetric constant is an NP-complete problem as shown by Mohar (1989).
96
Eigenvalues of the Laplacian T
and electric power transmission networks. A part of the network can only be cut o by destroying a large number of individual connections. In particular, sparse expanders, graphs with few links, have great interest, because the cost of a network usually increases with the number of links. A well-studied subclass of expanders are regular graphs. In Govers et al. (2008), Wigderson mentions that almost every regular graph with degree u 3 is an expander. The proof is probabilistic and does not provide insight how to construct a regular f-expander. Although nearly any regular graph is an expander, it turns out that there are only few methods to construct them explicitly. It follows from the bounds in art. 101 and f = that p 1 Q 1 f Q 1 (2u Q 1 ) 2 where Q 1 = u 2 (D) also equals the spectral gap (art. 55 and art. 74). The larger the spectral gap or the smaller 2 (D), the larger f and the stronger or the more robust the expander is. A remarkable achievement is the discovery that, for all s u-regular graphs, 2 (D) 2 u 1 and that equality is only attained in Ramanujan graphs, where u 1 is a prime power, as shown by Lubotzky et al. (1988). 103. Graph partioning. Since uL T is a non-negative matrix for u A gmax , a direct application of Fiedler’s Theorem 40 in art. 171 for n = 2 shows that a connected graph J can be partitioned into two distinct, connected components J1 and Jo2 , n where the nodes of J1 = J\J2 are elements of the set M = m 5 N : ({Q 1 )m , where {Q 1 is the eigenvector belonging to the second smallest eigenvalue Q1 of the Laplacian T and is some threshold value that specifies dierent disjoint partitions. Clearly, if A max1mQ ({Q 1 )m or if ? min1mQ ({Q1 )m , there is only the “trivial” partition consisting of the original graph J itself. Fiedler (1975) demonstrates that, by varying the threshold 0, all possible cuts that separate the graph J = J1 ^ J2 into two distinct (J1 _ J2 = B) connected components J1 and J2 can be obtained in this way. Art. 67 indicates that the sum over all positive vector components equals the sum over all negative ones. This means that the value = 0 in Fiedler’s partitioning algorithm divides the graph into two “equivalent” partitions, where “equivalent” is measured with respect to the second smallest Laplacian eigenvector. It does not imply, however, that both partitions have the same number of nodes.
4.4 The modularity and the modularity matrix P 104. Modularity. The modularity, proposed by Newman and Girvan (2004), is a measure of the quality of a particular division of the network. The modularity is proportional to the number of links falling within clusters or groups minus the expected number in an equivalent network with links placed at random. Thus, if the number of links within a group is no better than random, the modularity is zero.
4.4 The modularity and the modularity matrix P
97
A modularity approaching one reflects networks with strong community structure: a dense intra-group and a sparse inter-group connection pattern. If links are placed at random, then the expected number of links between node gl gm l and node m equals 2O . The modularity p is defined by Newman (2006) as ¶ μ Q Q 1 XX gl gm 1{l and m b elong to the same cluster} p= dlm (4.38) 2O l=1 m=1 2O We consider first a network partitioning into two clusters or subgraphs as in art. 96. The condition (indicator function) is rewritten in terms of the | vector, defined in art. 96, as 1 1{l and m b elong to the same cluster} = (|l |m + 1) 2 so that ¶ Q Q μ gl gm 1 XX |l |m dlm p= 4O l=1 m=1 2O because, by the basic law for the degree (2.3) and by (2.2), ¶ X Q μ Q Q X gl gm gl X = dlm dlm gm = 0 2O 2O m=1 m=1 m=1
(4.39)
Clearly, if there is only one partition to which all nodes belong, then | = x and the modularity is p = 0 as follows from (4.39). After defining the symmetric modularity matrix P with elements plm = dlm gl gm 2O , such that 1 g=gW (4.40) P =D 2O we rewrite the modularity p, with respect to a partitioning into two clusters specified by the vector |, as a quadratic form 1 W | P| 4O which is analogous to the number of links U in (4.30) between the two disjoint partitions. Generally, for a partitioning of the network into f clusters, instead of the vector |, the Q × f community matrix V, defined in art. 14, can be used to rephrase the condition as f X 1{l and m b elong to the same cluster} = Vln Vmn p=
n=1
which leads to the matrix representation of the modularity ¡ ¢ f Q Q trace V W P V 1 XXX Vln plm Vmn = p= 2O 2O l=1 m=1 n=1
(4.41)
Eigenvalues of the Laplacian T
98
We define the community vector vn as the n-th column of the community matrix V, which specifies the n-th cluster: all components of vn , corresponding to nodes belonging to cluster Fn , are equal to one, otherwise they are zero. For f = 2 clusters, we note that the vector | = v1 v2 , and that, in case f = 2, only one vector su!ces for the partitioning, instead of v1 and v2 . Using the eigenvalue decomposition (art. 156) of the symmetric modularity matrix P = Z diag(m (P )) Z W , where Z is the orthogonal Q × Q matrix with the m-th eigenvector zm belonging to m (P ) in column m, the general spectral expression for the modularity p for any number of clusters f follows from (4.41) as ³¡ ´ ¢W trace Z W V diag (m (P )) Z W V p= 2O à f ! Q 1 X X ¡ W ¢2 zm vn (4.42) m (P ) = 2O m=1 n=1
¢
¡
PQ
W because Z W V mn = t=1 Ztm Vtn = zm vn . In particular, the scalar product P zmW vn = t5Fn (zm )t is the sum of those eigenvector components of zm that belong to cluster Fn . If we write the community vector as a linear combination of P the eigenvectors of P , vn = Q m=1 nm zm , then the orthogonality of eigenvectors indicates that the coe!cients equal nm = zmW vn . Moreover, art. 14 shows that the Pf vectors v1 > v2 > = = = > vf are orthogonal vectors, and, by definition, that n=1 vn = x. Since x is an eigenvector of P belonging to the zero eigenvalue as follows from (4.39), we observe that f X zmW vn = 0 n=1
provided the eigenvector zm 6= x. Using the Cauchy identity (8.86) Ã f !2 f f p1 X X X X¡ ¡ W ¢2 ¢2 zm vn zmW (vp vn ) zmW vn = f n=1
n=1
we find that 1 X p= 2Of m=1 Q
Ã
p=2 n=1
! f p1 X X¡ ¢2 W zm (vp vn ) m (P )
p=2 n=1
which reduces for f = 2 and | = v1 v2 to (4.60)³ below. ´ ¡ ¢W ¡ ¢ Since Z Z W = L (art. 151), we have that trace Z W V Z W V = trace V W V = Q (art. 14), such that we obtain a companion of (4.42) f Q X X ¡ W ¢2 zm vn = Q
(4.43)
m=1 n=1
Let zt =
sx Q
denote the eigenvector of P belonging to the eigenvalue t (P ) = 0,
4.4 The modularity and the modularity matrix P then
99
f f f X ¡ W ¢2 1 X ¡ W ¢2 1 X 2 zt vn = x vn = qn Q Q
n=1
n=1
n=1
where qn is the number of nodes in cluster Fn . Invoking the inequality (3.39) to (4.42) subject to (4.43) yields ³P ³P ¡ W ¢2 ´ ¡ W ¢2 ´ PQ f f m (P ) m (P ) m=1;m6=t n=1 zm vn n=1 zm vn max = 1 (P ) ¡ W ¢2 PQ Pf ¡ W ¢2 P f 1mQ m=1;m6=t n=1 zm vn n=1 zm vn 2O Q ,
from which we find, with H [G] =
a spectral upper bound for the modularity ! Ã f 1 (P ) 1 X 2 p qn (4.44) 1 2 H [G] Q n=1
This bound can also be written as p
1 (P ) H [G]
μ ¶ 1 f 1 2 Var [qF ] f Q
where qF is the number of nodes in an arbitrary cluster, because H [qF ] = Pf Q n=1 qn = f .
1 f
105. Upper bound for the modularity. The general definition (4.38) is first rewritten as follows. We transform the nodal representation to a counting over links o = l m such that Q X f Q X X dlm 1{l and m b elong to the same cluster} = 2 On l=1 m=1
n=1
where On is the number of links of cluster Fn , and the factor 2 arises from the fact that all links are counted twice, due the symmetry D = DW of the adjacency matrix. If we denote by Ointer the number of inter-community links, i.e. the number of links that are cut by partitioning the network into f communities or clusters, then O=
f X
On + Ointer
n=1
Similarly, Q Q X X
gl gm 1{l and
m b elong to the same cluster}
=
l=1 m=1
f X n=1
where GFn =
X
Ã
X
l5Fn
4 !3 f X X 2 gl C gm D = GF n m5Fn
n=1
gl
l5Fn
is the sum of the degrees of all nodes that belong to cluster Fn . Clearly, GFn 2On , because some nodes in cluster Fn may possess links connected to nodes in
Eigenvalues of the Laplacian T
100
Pf other clusters. The basic law of the degree (2.3) then shows that n=1 GFn = 2O. Substituting these expressions in the definition (4.38) leads to an alternative expression6 for the modularity Ã μ ¶2 ! f X GFn On p= (4.45) O 2O n=1 Pf Pf 2 Subject to the basic law of the degree, n=1 GFn = 2O, the sum n=1 GFn is 2O maximized when GFn = f for all 1 n f. Indeed, the corresponding Lagrangian à f ! f X X 2 L= GF + GFn 2O n n=1
n=1
where is a Lagrange multiplier, supplies the set of equations for the optimal Pf CL solution, CG = 2GFm + = 0 for 1 m f and CL n=1 GFn 2O = 0, which C = Fm 2 P 4O 2O 2 is satified for = f and GFm = f for all 1 m f. Hence, fn=1 GF (2O) f . n The modularity in (4.45) is minimized, for f A 1, if On = 0 for 1 n f and Pf 1 2 n=1 GFn is maximized such that p f . In conclusion, the modularity of any 1 graph is never smaller than 2 , and this minimum is obtained for the complete bipartite graph. Pf Invoking the Cauchy identity (8.86) and n=1 GFn = 2O, f X n=1
¢2 (2O)2 1 X X ¡ GFm GFn + f f m=2 f
2 GF = n
m1
n=1
results in yet another expression for the modularity ¶2 f m1 μ Ointer 1 1 X X GFm GFn p=1 O f f m=2 2O
(4.46)
n=1
Since the double sum is always positive, (4.46) provides us with an upper bound for the modularity, 1 Ointer p1 (4.47) f O The upper bound (4.47) is only attained if the degree sum of all clusters is the same. In addition, the upper bound (4.47) shows that p 1 and that a modularity of 1 is only reached asymptotically, when the number of clusters f $ 4 and Ointer = r (O), implying that the fraction of inter-community links over the total number of links O is vanishingly small for large ¯ graphs (Q ¯ $ 4 and O $ 4). Let GF = max{Fm >Fn } ¯GFm GFn ¯, then a lower bound of the modularity, deduced from (4.46), is μ ¶2 1 (f 1) GF Ointer (4.48) p1 O f 2 2O 6
Newman (2010) presents still another expression for the modularity.
4.4 The modularity and the modularity matrix P
101
Only if GF = 0, the lower bound (4.48) equals the upper bound (4.47) and the equality sign can occur. Excluding the case that GF = 0, then not all GFm are equal, and we may assume an ordering GF1 GF2 = = = GFf , with at least one strict inequality. We demonstrate that, for f A 2, not all dierences GFm GFn = GF A 0 for any pair (m> n). For, assume the contrary so that GF1 GF2 = GF2 GF3 = GF1 GF3 = GF A 0, then GF = GF1 GF3 = (GF1 GF2 ) + (GF2 GF3 ) = 2GF , which cannot hold for GF A 0. Hence, if GF A 0, the inequality in (4.48) is strict; alternatively, the lower bound (4.48) is not attainable in that case. In order for a network to have modular structure, the modularity must be positive. The requirement that the lower bound (4.48) is non-negative, supplies us with an upper bound for the maximum dierence GF in the nodal degree sum between two clusters in a “modular” graph s μ ¶ Ointer 2 1 GF 2O 1 (4.49) f1 O f For f A 1, (4.49) demonstrates that GF ? 2O. Ignoring the integer nature of f, the lower bound (4.48) is maximized with respect to the number of clusters f when s 2 2O s f = A 2 (4.50) GF resulting in p1
Ointer s 2 O
μ
GF 2O
¶ +
1 2
μ
GF 2O
¶2
F Theμright-hand ¶ side in this lower bound is positive provided that 1 A G2O A q s nter F . When this lower bound for G2O 2 1 Oi O is satisfied, the modularity p
is certainly positive, implying that the graph exhibits modular structure. 106. Spectrum of the modularity matrix P . Since the row sum (4.39) of the modularity matrix P is zero, which translates to P x = 0, the modularity matrix has a zero eigenvalue corresponding to the eigenvector x, similar to the Laplacian matrix (art. 2). Unlike the Laplacian T, the modularity matrix P always has negative eigenvalues. Indeed, from (8.7) and art. 25, the sum of the eigenvalues of P equals Q Q X 1 X 2 Q2 m (P ) = gm = (4.51) 2O m=1 Q1 m=1 where Qn is the total number of walks of length n (art. 33). With a little more eort, we find that Q X
Q ¢ ¢ ¡ ¡ ¢ 1 ¡ 1 X 2 2m (P ) = trace D2 trace DggW + gm trace g=gW 2 O (2O) m=1 m=1
Eigenvalues of the Laplacian T
102
Using (3.5) and art. 33, we have 42 3 μ ¶2 Q X 1 1 2Q3 Q2 2 W 2D C m (P ) = 2O g Dg + gm = Q1 + O 2O m=1 Q1 Q1 m=1
Q X
(4.52)
In general, P and D do not commute, similar to the fact that T and D also do not commute. Hence, art. 184 shows that the set of eigenvectors {zn }1nQ of P is dierent from the set of eigenvectors {{n }1nQ of D. 1 The eigenvalues of the modularity matrix P = D 2O g=gW are zeros of the characteristic polynomial μ ¶ 1 W det (P L) = det D L g=g 2O ¶ μ 1 1 W (D L) g=g = det (D L) det L 2O Using the “rank one update” formula (8.82), we have ¶ μ 1 W 1 g (D L) g det (P L) = det (D L) 1 2O
(4.53)
We invoke the resolvent (8.66) in art. 178 gW (D L)
1
g=
¢2 Q ¡ W X g {p p p=1
where {p is the eigenvector of D belonging to eigenvalue p . Since gW {p = xW D{p = p xW {p , we obtain ( ¡ ¢2 ) Q X 2p xW {p 1 1 W 1 g (D L) g = 1 2O 2O 2O p p=1 Using Q1 = 2O and (3.11),
¡ ¢2 ) Q ¡ W ¢2 X 2p xW {p p x {p p p=1 p=1 ¢2 Q ¡ X xW {p p = 2O p=1 p
1 1 W g (D L)1 g = 1 2O 2O
(
Q X
which can, in view of (3.17), be written in terms of the generating function QJ (}) of the total number of walks (art. 34). Thus, we arrive at7 μ ¶ μ ¶ 1 det (D L) QJ Q (4.54) det (P L) = 2O 7
Invoking (3.20) and fD () = det (D 3 L), another expression for the characteristic polynomial is det (P 3 L) = (31)Q fDf (3 3 1) 3 ( + Q) fD () 2O
4.4 The modularity and the modularity matrix P 103 ¡1¢ Since lim$0 QJ = 0, the characteristic polynomial (4.54) of P illustrates that = 0 is an eigenvalue of P , corresponding to the eigenvalue x as shown above. 1 W By a¡ same argument as in art. 180, the function j () = 1 2O g (D L)1 g = ¢ QJ 1 Q has simple zeros that lie in between two consecutive eigenvalues of the adjacency matrix D. In summary, the eigenvalues of the modularity matrix P interlace with the eigenvalues of adjacency matrix D: 1 (D) 1 (P ) 2 (D) 2 (P ) = = = Q (D) Q (P ). 107. Spectrum of the modularity matrix P for regular graphs. For regular graphs, where each node has degree u and Dx = ux (art. 41), we have that (D L) x = 1 1 (u ) x from which (D L) x = (u ) x. Substituted in (4.53) yields, with the degree vector g = u=x, ³ ´ u det (P L) = det (D L) 1 xW (D L)1 x Q ¶ μ u xW x = det (D L) = det (D L) 1 Q (u ) u After invoking the basic relation (8.5), we arrive at Y (n (D) ) u Q
det (P L) =
n=1
=
Q Y
(n (D) )
n=2
Hence, the eigenvalues of the modularity matrix P of a regular graph are precisely equal to the eigenvalues of the corresponding adjacency matrix D, except that the largest eigenvalue 1 (D) = u is replaced by the eigenvalue at zero. ¡ ¢ 108. The largest eigenvalue of the modularity matrix. Since QJ 1 Q A 0 in (4.54) for 1 as follows from (3.15) in art. 34, 1 (P ) 1 (D). This inequality is also found from the interlacing property of P and D derived in art. 106. We will show here that 1 (P ) ? 1 (D). Since = 0 is always an eigenvalue of P (art. 106), there cannot be a smaller largest eigenvalue than zero. The interlacing property bounds the largest eigenvalue from below, 1 (P ) 2 (D), and art. 58 demonstrates that all graphs have a non-negative second largest eigenvalue 2 (D) 0, except for the complete graph. The modularity matrix of the complete graph NQ is PNQ = Q1 M L, whose charQ Q 1 acteristic polynomial is det (P L) = (1) (1 + ) as follows from (5.1). This illustrates that the largest eigenvalue of the complete graph is 1 (PNQ ) = 0, which is also the smallest possible largest modularity eigenvalue of all graphs. The eigenvector z1 of P belonging to 1 (P ) has negative components (in contrast to the largest eigenvector {1 of D), because xW z1 = 0, which is similar to the eigenvectors of the Laplacian T (art. 67). The Rayleigh equation (8.28) and the
Eigenvalues of the Laplacian T
104
Rayleigh inequalities in art. 152 demonstrate that ¡ ¢2 z1W P z1 z1W Dz1 1 z1W g 1 ¡ W ¢2 z g = 1 (D) 1 (P ) = 2O z1W z1 2O 1 z1W z1 z1W z1
(4.55)
because z1W z1 = 1 as the orthogonal eigenvectors are normalized (art. 151). The scalar product z1W g is only zero for regular graphs, where each node has degree u, because the degree vector is g = u=x and z1W x = 0, provided z1 6= sxQ (as in the complete graph). However, art. 107 shows that the largest eigenvalue for regular graphs equals 1 (Pu ) = max (0> 2 (Du )) ? 1 (Du ), where the subscript u explicitly refers to regular graphs. Due to interlacing (art. 106), of all graphs, the regular graph has the smallest largest eigenvalue of the modularity matrix. Because the last term in the above upper bound is always strictly positive for nonregular graphs, we obtain the range of 1 (P ) for any graph: 0 1 (P ) ? 1 (D). In summary, the largest eigenvalue of the modularity matrix P is always strictly smaller than the largest eigenvalue of the corresponding adjacency matrix D. For non-regular graphs, the degree vector g is not proportional to the eigenvector x of P (art. 41) and z1W g 6= 0. We can write the degree vector g as a linear combination of the eigenvectors of P , g=
Q X
n zn
where n = gW zn
(4.56)
n=1
s Q t and t A n for 1 n 6= t Q PQ by a similar argument as in art. 38. In addition, we have gW g = n=1 n2 and ¢ ¡ 2 gW g Q 2O = Q Var[G] A 0, such that Q
Let zt =
sx , Q
then gW x = 2O =
1 1 ¡ W ¢2 Var [G] z g = 2O 1 H [G] 2O
Q X
n2
n=2;n6=t
Unfortunately, it is di!cult ¡ W ¢2to estimate the last sum in order to provide a good 2 lower bound for 1 = z1 g in (4.55). Next, we apply the Rayleigh principle to the adjacency matrix D, 1 (D) =
{W1 D{1 {W1 P {1 1 ¡ W ¢2 1 ¡ W ¢2 {1 g 1 (P ) + { g = + W W 2O 2O 1 {1 {1 {1 {1
(4.57)
Combining both Rayleigh inequalites (4.57) and (4.55), we obtain bounds for the dierence 1 (D) 1 (P ) A 0, 1 ¡ W ¢2 1 ¡ W ¢2 z1 g 1 (D) 1 (P ) { g 2O 2O 1 Since {W1 g = {W1 DW x = (D{1 )W x = 1 (D) {W1 x, we arrive from (4.57) at the lower bound ( ) ¡ W ¢2 {1 x 1 (D) 1 (P ) 1 (D) 1 2O
4.4 The modularity and the modularity matrix P 105 ¡ W ¢2 which is only useful when the term in brackets is positive, {1 x can be determined accurately8 and when the lower bound is larger than 2 (D). On the other hand, the scalar product {W1 g is maximal if {1 = s gW , such that, using (4.51), g g
Q X Q2 1 ¡ W ¢2 gW g {1 g = = m (P ) 2O 2O Q1 m=1
from which we obtain, together with (4.57), the upper bound 1 (D)
Q X
m (P )
m=2
109. Bounds for the largest eigenvalue of the modularity matrix. Since gW P g = ¡ W ¢2 Q2 1 g g = Q3 Q21 , we obtain with (4.56) gW Dg 2O Q22 X 2 = n n (P ) Q1 Q
Q3
(4.58)
n=1
As shown in Section 7.5, the sign of (4.58) determines whether a graph is assortative (positive sign) or disassortative (negative sign). Similarly, from gW P 2 g, we deduce that Q Q3 Q2 Q3 X 2 2 Q4 2 + 22 = n n (P ) Q1 Q1 n=1
By applying the inequality (3.39), we obtain PQ n2 n (P ) Q2 Q3 2 n (P ) = n=1 max n 2 = 1 (P ) PQ 2 1nq Q2 Q1 n n=1 n and Q3 Q4 2 + Q2 Q1
μ
Q2 Q1
¶2 21 (P )
Application of Laguerre’s Theorem 64, combined with art. 198 and trace relations (4.51) and (4.52), yields the rather complicated upper bound sμ ¶ μ ¶ μ ¶ 2 Q 1 1 Q2 Q 2Q3 Q2 1 (P ) + (4.59) Q1 Q Q1 Q Q1 Q 1 Q1 For regular graphs where Qn = Q un and 0 ? 1 (Pu ) = 2 (Du ), the bound (4.59) provides an upper bound for the second largest eigenvalue of the adjacency matrix, p u 1p 2 (Du ) + u (Q 1) Q 2 (Q + 1) u Q Q 8
2 Indeed, the bound {W $ Q, as shown in art. 38, leads to a lower bound 1 (D) 3 1x 1 (P), that is smaller than zero for non-regular graphs and, thus, useless.
2 1 (D) H[G]
$
106
Eigenvalues of the Laplacian T
For the complete graph NQ , where u = Q 1 and 1 (PNQ ) = 0, the bound (4.59) is exact. In view of the upper bound (4.44) for the modularity, the bound (4.59) is only useful when the right-hand side is smaller than the average degree H [G]. Numerical evaluations indicate that the bound (4.59) is seldom sharp. 110. Maximizing the modularity. Maximizing the modularity p consists of finding the best Q × f community matrix V in either definition (4.41) or (4.42). Numerous algorithms, that (approximately for f A 2) find the best community matrix V, exist, for which we refer to Newman (2010). Here, we concentrate on a spectral method. 1 W Starting from the quadratic form p = 4O | P | for the modularity, where the number of clusters f = 2, Newman (2006) mimics the method in art. 96 by writing PQ the vector | = m=1 m zm with m = | W zm as a linear combination of the orthogonal eigenvectors z1 > z2 > = = = > zQ of P , 1 X 2 m (P ) 4O m=1 m Q
p=
(4.60)
Maximizing the modularity p is thus equal to choosing the vector | as a linear combination of the few largest eigenvectors, such that components of | are either 1 and +1, which is di!cult as mentioned above in art. 96. ¯ Newman (2006) ¯ PQ ¯ ¯ proposes to maximize 1 = | W z1 and the maximum 1 = m=1 ¯(z1 )m ¯ is reached when each component |m = 1 if (z1 )m ? 0 or |m = 1 if (z1 )m 0. Moreover, using properties of norms (art. 162), we find that 1 = kz1 k1 kz1 k2 = 1, and by construction and the orthogonality of the eigenvectors, m ? kzm k1 . This separation of nodes into two partitions according to the sign of the vector components in the largest eigenvector z1 of P is similar in spirit to Fiedler’s algorithm (art. 103). Apart from the sign considered so far, a large eigenvector component contributes more to the modularity p in (4.60) than a small (in absolute value) component. Thus, the magnitude (in absolute value) of the components in z1 measure how firmly the corresponding node in the graph belongs to its assigned group, which is a general characteristic of a class of spectral measures called “eigenvalue centralities”, defined in Section 7.8.1. Notice that, since x is the eigenvector belonging to (P ) = 0, the trivial partition of whole the network in one group, is excluded from modularity (because (P ) = 0 does not contribute to the sum in (4.60)) and that any other eigenvector, due to the orthogonality (art. 151), must have at least one negative component. In contrast to the Fiedler partitioning based on the Laplacian, the situation where all non-zero eigenvalues of P are negative might occur (as in the complete graph, for example; art. 108), which indicates that there is no partition, except for the trivial one, and that the modularity p in (4.60) is negative. This observation is important: Newman (2006) exploits the fact that p ? 0 to not partition a (sub)network. 111. Newman’s iterated bisection. Let us now consider a network partitioning in more than two clusters or groups. Usually, as in Fiedler’s approach, we partition
4.4 The modularity and the modularity matrix P
107
the graph first into two subgraph, then apply Fiedler’s algorithm recursively to each subgraph, which is divided again into two parts, and so on. Newman (2006) remarks that deleting the links between the two partitions, and then applying the second iteration of partitioning into two parts, is not correct, because the modularity in (4.38) will change if links are deleted. Instead, Newman proposes to write the additional contribution p to the modularity upon further dividing a group j of Qj nodes into two as 3 4 X X 1 C plm |l |m plm D p = 4O l>m5j l>m5j 3 4 X X 1 1 W Cplm lm | Pj |j = pln D |l |m = (4.61) 4O l>m5j 4O j n5j
where the Qj × Qj symmetric matrix Pj has elements (Pj )lm indexed by the links (l> m) within the group j, X (Pj )lm = plm lm pln P
P
n5j
P We note that Pj x = m5j plm m5j lm n5j pln = 0 and that n5j pln = 0 for all l, only if j = J, because then P x = 0, implying that this sum vanishes in the first step of partitioning process (as in (4.38)). Hence, Pj formally possesses the same properties as P and we can apply the above spectral algorithm derived from (4.60) to further partition the group j into two parts, provided Pj has positive eigenvalues. Since j is a subgraph of J, the Interlacing Theorem 42 states that the eigenvalues of Pj interlace with those of P , such that subsequent divisions have a smaller impact on the modularity. As explained above, if Pj has nonpositive eigenvalues, the group j should not be divided, because the contribution p to the total modularity should be positive, else nothing is gained. The recursive subpartitioning of a group into two smaller groups is terminated if the eigenvalues of Pj are all non-positive, which is an elegant check in Newman’s partitioning algorithm. This stopping criterion is su!cient to determine indivisibility of a group, but it is not always necessary. Indeed, when there are a few, small positive and many large negative eigenvalues of Pj , the sum in (4.60) can be negative. We can guard against this possibility by just checking in (4.61) whether p 0. If p ? 0, we leave the corresponding subgraph undivided. As a result, the outcome of the algorithm gives subgraphs that are all indivisible, according to the modularity measure. Finally, we end by mentioning another algorithm that does not involve spectral analysis. Assume some initial split of the graph into two groups. We move a node from one group to the other, only if the resulting modularity increases, and we start preferably with the node whose move has the largest increase in p. We repeatedly move each node once in such way. To be sure that no greater modularity is possible P
108
Eigenvalues of the Laplacian T
after one entire round over all the nodes, we can repeat the process iteratively until the modularity cannot further be improved. The best partitioning results according to Newman (2006) seem to be achieved when first the spectral method above is followed up to some broad division of the network, which is then refined by the repeated move algorithm, due to Kerninghan and Lin (1970).
4.5 Bounds for the diameter 112. Diameter . Another noteworthy deduction from the Alon-Milman bound (4.33) is: Theorem 15 (Alon-Milman) The diameter of a connected graph is at most "s # 2gmax log2 Q + 1 (4.62) Q1 Proof: If E is the set of all nodes of J at a larger distance than k from D and D contains at least half of the nodes (d 12 ), then (4.36) gives μ r ¸¶ 1 Q 1 e exp ln (2) k 2 2gmax ³ h q i´ q Q 1 2gmax 1 If we require that exp ln (2) k 2g , then k Q Q1 log2 Q ? max hq i 2gmax 1 Q1 log2 Q + 1. By construction, for such k, e ? Q or E = B, which implies
that D = N . Next, if y 5 N , then the subset {yk } of nodes that is reached within k hops of node y contains more than Q@2 nodes. Indeed, suppose the converse and define D = N \ {yk }. Then d = D@Q A 12 . But, we have shown that, if k = , then D = N . This contradicts the hypothesis. Hence, all nodes in J are reached from an arbitrary node within k = hops, where is specified in (4.62). ¤ Theorem 16 (Van Dam-Haemers) The diameter of a connected graph is at most " # log 2 (Q 1) ¢ ¡s ¢ +1 ¡s (4.63) s s log 1 + Q 1 log 1 Q 1 Proof: The proof is based on the quotient matrix (art. 15) of a graph and on interlacing (art. 182). ¤ Theorem 17 (Mohar) The diameter of a connected graph is at most 6 5 Q log ³ 2 ´: 29 9 + : : 9 log ggmax max where is the isoperimetric constant.
(4.64)
4.6 Eigenvalues of graphs and subgraphs
109
Proof: Mohar (1989) considers the subsets Dx (u) = {y 5 N : g (y> x) u} at distance u of node x. The definition (4.37) shows that, for |Dx (u)|
£Q ¤ 2 ,
(|Dx (u)| + |Dx (u 1)|) CDx (u) + CDx (u 1) where CDx (u) contains all the links between the set Dx (u) \Dx (u 1) and the set Dx (u + 1) \Dx (u). Hence, CDx (u) + CDx (u 1) contains all links in two-hop shortest paths between the set Dx (u 1) \Dx (u 2) and the set Dx (u + 1) \Dx (u), which equals X CDx (u) + CDx (u 1) = gy gmax (|Dx (u)| |Dx (u 1)|) y5Dx (u)\Dx (u1)
Thus, (|Dx (u)| + |Dx (u 1)|) gmax (|Dx (u)| |Dx (u 1)|) £ ¤ from which, for |Dx (u)| Q2 , |Dx (u)| gmax + |Dx (u 1)| gmax Since |Dx (0)| = 1 (and |Dx (1)| = gx ), iterating yields ¶u μ gmax + |Dx (u)| gmax ¼ » £ ¤ log Q provided |Dx (u)| Q2 , which restricts umax log gmax2 + . This maximum ( gmax ) hopcount reaches half of the nodes. To reach also the other half of nodes in the complement, at most 2umax hops are needed, which proves (4.64). ¤
4.6 Eigenvalues of graphs and subgraphs 113. If J1 and J2 are link-disjoint graphs on the same set of nodes, then the union J = J1 ^ J2 possesses the adjacency matrix DJ = DJ1 + DJ2 and the Laplacian TJ = TJ1 + TJ2 . Art. 183 then states that, for each eigenvalue 1 n Q , Q (J1 ) + n (J2 ) n (J) n (J2 ) + 1 (J1 ) n (J2 ) n (J) n (J2 ) + 1 (J1 ) This shows that the Laplacian eigenvalues n (J) are non-decreasing if links are added in a graph, or, more generally, if J2 J and both have the same number of nodes, QJ2 = QJ , then n (J2 ) n (J). 114. The general result in art. 113 can be sharpened for the specific case of adding one link to a graph. If J + {h} is the graph obtained from J by adding a link, then the incidence matrix EJ+{h} consists of the incidence matrix EJ with one added
110
Eigenvalues of the Laplacian T
column containing the vector }, that has only two non-zero elements, 1 at row h+ and 1 at row h . Hence, W TJ+{h} = EJ EJ + }} W = TJ + }} W
and ¡ ¢ ¡ ¢ det TJ+{h} L = det TJ + }} W L ³ ´ = det (TJ L) det L + (TJ L)1 }} W Applying the “rank one update” formula (8.82) yields ³ ´ 1 1 det L + (TJ L) }} W = 1 + } (TJ L) } W The same argument as in art. 180 shows that the strictly increasing rational funcdet(TJ+{h} L ) only possesses simple poles and zeros that lie in between the tion det(T J L) poles. From the common zero Q (J) = Q (J + {h}) = 0 on, the function det(TJ+{h} L ) increases implying that first the pole at Q 1 (J) is reached bedet(TJ L) fore the zero at Q1 (J + {h}). Hence, we obtain m (J) m (J + {h}) m1 (J) for all 1 ? l Q and at l = 1, 1 (J) 1 (J + {h}). Comparing this bound for m = Q 1 with (4.29) in art. 95 yields Q 1 (J) Q 1 (J + {h}) min (Q 2 (J) > Q1 (J) + 2) 115. Laplacian spectrum of the cone of a graph. When a node n is added to a graph J, a similar analysis as in art. 60 applies. From the adjacency matrix (3.60), the corresponding Laplacian is " # TQ ×Q¡ + ¢diag (yl ) yQ×1 T(Q +1)×(Q +1) = y W 1×Q gn Let us confine ourselves to the special case y = x, where the new node n is connected to any other node in graph, thus forming the cone of the graph J.£ Let z be¤ the eigenvector of TQ ×Q belonging to Q 1 , then, for the vector } W = zW 0 , " # ¸ ¸ TQ + L y (Q 1 + 1) z z ×Q Q ×1 ¢ ¡ = T(Q+1)×(Q +1) } = y W 1×Q Q 0 yW z Only if y = x, in which case xW z = 0, then } is an eigenvalue of T(Q +1)×(Q+1) belonging to Q1 + 1. In fact, as shown by Das (2004), the entire spectrum can be deduced by considering the complement JfQ+1 of the cone of JQ . Since the cone node has degree Q , the complement JfQ +1 is disconnected. Theorem 10 states that the Laplacian of JfQ+1 has at least two eigenvalues fQ = fQ1 = 0, while art. 80 tells us that the
4.6 Eigenvalues of graphs and subgraphs
111
then shows remaining Laplacian eigenvalues of JfQ+1 are those ©of J¡fQ . Using (4.9)¢ª that the set of eigenvalues of the cone of a graph, m T(Q+1)×(Q +1) 1mQ +1 , are Q + 1, m (TQ×Q ) + 1 for 1 m Q 1> and zero. 116. Removal of a node. Let us consider the graph J\ {m} obtained by removing an arbitrary node m and its incident links from J. Art. 115 shows that the Laplacian eigenvalues of the cone of J\ {m} equal Q , 1 (J\ {m}) + 1, 2 (J\ {m}) + 1, . . . , Q 2 (J\ {m}) + 1 and 0. The original graph J is a subgraph of the cone of J\ {m}. Since the Laplacian eigenvalues are non-decreasing if links are added to the graph (art. 113), we conclude that, for all 1 m Q 2, m (J\ {m}) + 1 m+1 (J) 117. Vertex connectivity N (J). The vertex connectivity of a graph, N (J), is the minimum number of nodes whose removal (together with adjacent links) disconnects the graph J. The Rayleigh principle (art. 152) shows,¡for any other ¢connection vector y 6= x in art. 115, that } W T(Q +1)×(Q+1) } Q1 T(Q +1)×(Q+1) such that ¡ ¢ Q 1 T(Q +1)×(Q+1) Q 1 (TQ ×Q ) + 1 Repeating the argument gives ¡ ¢ Q1 T(Q+n)×(Q +n) Q 1 (TQ ×Q ) + n If N (J) = n, the above relation shows that Q 1 N (J)
(4.65)
of minimum Indeed, for a disconnected graph Q 1 (TQ ×Q )¡ = 0 and the addition ¢ (J) = n nodes connects the graph, i.e., Q1 T(Q+n)×(Q +n) A 0. 118. Edge connectivity L (J). The edge connectivity of a graph, L (J), is the minimum number of links whose removal disconnects the graph J. For any connected graph J, it holds that N (J) L (J) gmin (J)
(4.66)
Indeed, let us concentrate on a connected graph J that is not a complete graph. Since gmin (J) is the minimum degree of a node, say q, in J, by removing all links of node q, J is disconnected. By definition, since L (J) is the minimum number of links that leads to disconnectivity, it follows that L (J) gmin (J) and L (J) Q 2 because J is not a complete graph and consequently the minimum nodal degree is at most Q 2. Furthermore, the definition of L (J) implies that there exists a set V of L (J) links whose removal splits the graph J into two connected subgraphs J1 and J2 , as illustrated in Fig. 4.2. Any link of that set V connects a node in J1 to a node in J2 . Indeed, adding an arbitrary link of that set makes J again connected. But J can be disconnected into the same two connected subgraphs by removing nodes in J1 and/or J2 . Since possible disconnectivity inside
Eigenvalues of the Laplacian T
112
either J1 or J2 can occur before L (J) nodes are removed, it follows that N (J) cannot exceed L (J), which establishes the inequality (4.66).
G2
G1 C
A
B
Fig. 4.2. A graph J with Q = 16 nodes and O = 32 links. Two connected subgraphs J1 and J2 are shown. The graph’s connectivity parameters are N (J) = 1 (removal of node = 4. F), L (J) = 2 (removal of links from F to J1 ), gmin (J) = 3 and H [G] = 2O Q
Let us proceed to find the number of link-disjoint paths between D and E in a connected graph J. Suppose that K is a set of links whose removal separates D from E. Thus, the removal of all links in the set K destroys all paths from D to E. The maximum number of link-disjoint paths between D and E cannot exceed the number of links in K. However, this property holds for any set K, and thus also for the set with the smallest possible number of links. A similar argument applies to node-disjoint paths. Hence, we end up with Theorem 18: Theorem 18 (Menger’s Theorem) The maximum number of link- (node)-disjoint paths between D and E is equal to the minimum number of links (nodes) separating (or disconnecting) D and E. Recall that the edge connectivity L (J) (analogously vertex connectivity N (J)) is the minimum number of links (nodes) whose removal disconnects J. By Menger’s Theorem, it follows that there are at least L (J) link-disjoint paths and at least N (J) node-disjoint paths between any pair of nodes in J. 119. Edge connectivity L (J) and the algebraic connectivity Q1 . Fiedler (1973) has proved a lower bound for Q 1 in terms of the edge connectivity L (J). Theorem 19 (Fiedler) For any graph J with O links and Q nodes, ³ ´ Q 1 2L (J) 1 cos Q
(4.67)
1 T in Theorem Proof: Consider the symmetric, stochastic matrix S = L gmax Q 1 39. The spectral gap of S equals 1 2 (S ) = gmax , and is lower bounded in (8.55) by
#q (u (S )) 1 2 (S ) ¢ ¡ where #q ({) = 2{ 1 cos q for { 12 and the measure of irreducibility u (S ),
4.6 Eigenvalues of graphs and subgraphs
113
(J) . Indeed, by Merger’s Theorem 18, the defined in (8.52), equals u (S ) = gLmax maximum number of link-disjoint paths between node D and E equals the minimum number of links that separates D from E. Hence, there are at least L (J) linkdisjoint paths between any pair of nodes in J. ¤
We note that the function #q ({) in Theorem 39 provides a second bound ¶ μ ³ 2 ´ cos 2gmax 1 cos Q 1 2L (J) cos cos Q Q Q Q which is only better than (4.67) if and ¢ L (J) A gmax . Using (5.7) for a cir¡ only if22 cuit F, shows that (F) = 2 1 cos Q 1 Q , while, for a path S , Q 1 (S ) = ¡ ¢ 2 1 cos Q follows from (5.8). Also, L (F) = N (F) = 2 and L (S ) = N (S ) = 1, which shows that equality is achieved in the bound (4.67) for the path S . However, in most cases as verified for example from Fig. 4.1, the lower bound (4.67) is rather weak. 120. Pendants in a graph. A node with degree one is called a pendant. Many complex networks possess pendants. If a connected graph J has a pendant, then the second smallest eigenvalue Q1 1 as follows from9 (4.22) in art. 90. If the pendant is not adjacent to the highest degree node, then Q1 ? 1. The latter result is based on the observation that, the complement Jf of J, has at least one node of degree Q 2, namely the complementary node of the pendant. This node is thus almost the corner node in the cone of Jf and the star tree with this corner node in the center is a spanning tree W if precisely one node at distance 2 of the corner node is added to that star. Since W = N1>Q 2 + {h}, art. 114 shows that 1 (W ) A 1 (N1>Q 2 ) = Q 1 because 1 (N1>Q2 ) = Q 1 as computed in Section 5.7. Since the spanning tree W is a subtree graph of Jf , art. 113 implies that 1 (Jf ) 1 (W ) A Q 1 such that we arrive, with (4.9), at Q1 (J) ? 1. The following theorem is due to Das (2004): Theorem 20 (Das) If J is a connected graph with a Laplacian eigenvalue 0 ? ? 1, then the diameter of J is at least 3. Proof: Let { denote the eigenvector belonging to , then the equation for the m-th component is {m =
Q X n=1
9
tmn {n = gm {m
Q X n=1
dmn {n = gm {m
Q X
{n
n5neighb or(m)
Fiedler’s general upper bound (4.20) for Q 31 leading to (4.21) is not sharp enough to establish this result.
Eigenvalues of the Laplacian T
114
If {m = max1nQ {n = {max is the largest component of the eigenvector { and let {min;m = minn5neighb or(m) {n with arg {min = nm , then {min;m = (gm ) {m
Q X
{n
n5neighb or(m)\nm
(1 ) {m PQ
because n5neighb or(m)\nm {n (gm 1) {max = (gm 1) {m . Similarly, if {m = max1nQ {n = {min is the largest component of the eigenvector { and let {max;m = maxn5neighb or(m) {n with arg {max = nm , then {max;m = (gm ) {m
Q X
{n
n5neighb or(m)\nm
(1 ) {m PQ
because n5neighbor(m)\nm {n (gm 1) {min = (gm 1) {m . These inequalities show that, if 0 ? ? 1, the eigenvector components corresponding to the neighbors of the node m with largest (smallest) eigenvector component, have the same sign as {m . Art. 67 shows that the largest and smallest eigenvector component (for 6= Q = 0) must have a dierent sign. This implies that the nodes with largest and smallest eigenvector component are not neighbors (not directly connected), nor have neighbors in common. Since J is connected, this means that the diameter in J is at least 3. ¤
5 Spectra of special types of graphs
This chapter presents spectra of graphs that are known in closed form.
5.1 The complete graph The eigenvalues of the adjacency matrix of the complete graph NQ are 1 = Q 1 and 2 = = = = = Q = 1. Since NQ is a regular graph (art. 74), the eigenvalues of the Laplacian are, apart from Q = 0, all equal to m = Q for 1 m Q 1. The eigenvalues can be computed from the determinant in (8.2) in the same way as in art. 82. Alternatively, the adjacency matrix of the complete graph is DNQ = M L and M = x=xW . A direct computation yields ¶ μ ¢ ¡ W x=xW Q det (M L L) = det x=x ( + 1) L = ( ( + 1)) det L +1 Using (8.82) and xW x = Q , we obtain Q
det (M L L) = ( ( + 1))
μ 1 Q 1
= (1)Q ( + 1)
Q +1
¶
( + 1 Q )
from which the eigenvalues of the adjacency matrix of the complete graph NQ are immediate. In summary, det (M {L)q×q = (1)q {q1 ({ q)
(5.1)
5.2 A small-world graph In a small-world graph JSW n , each node is placed on a ring as illustrated in Fig. 5.1 and has links to precisely n subsequent neighbors and, by the cyclic structure of the ring, also to n previous neighbors. The small-world graph has been proposed by Watts and Strogatz (1998) — and is further discussed in Watts (1999) — to study the eect of adding random links to a regular network or of rewiring links randomly. The thus modified small-world graphs are found to be highly clustered, like regular 115
116
Spectra of special types of graphs
graphs. As mentioned in Section 1.3, depending on the rewiring process of links, typical paths may have a large hopcount, unlike in random graphs. The adjacency matrix DSW n is of the type of a symmetric circulant, Toeplitz matrix whose eigenvalue structure (eigenvalues and eigenvectors) can be exactly determined by the Fourier matrix.
Fig. 5.1. A Watts-Strogatz small-world graph JS W n with n = 2 is a regular graph with degree g = 4.
5.2.1 The eigenvalue structure of a circulant matrix A circulant matrix F is an q × q matrix with the form 3 fq1 fq2 · · · f1 f0 E f1 f0 fq1 · · · f2 E E .. . f3 F=E f1 f0 E f2 E . . . . . . ... .. .. C .. fq1 fq2 fq3 · · · f0
4 F F F F F F D
Each column is precisely the same as the previous one, but the elements are shifted one position down and wrapped around at the bottom. In fact, fmn = f(mn) mod q , which shows that diagonals parallel to the main diagonal contain the same elements. The elementary circulant matrix H has all zero elements except for f1 = 1, 4 3 0 0 0 ··· 1 E 1 0 0 ··· 0 F F E F E .. E . 0 F H=E 0 1 0 F F E . . . . . . . . ... D C .. .. 0 0
0
···
0
5.2 A small-world graph
117
and represents a unit-shift relabeling transformation of nodes: 1 $ 2> 2 $ 3> = = = > q $ 1. Thus, the unit-shift relabeling transformation, which is a particular example of a permutation (art. 10), maps the vector { = ({1 > {2 > = = = > {q ) into H{ = ({q > {1 > {2 > = = = > {q1 ). Again applying the unit-shift relabeling transformation maps H{ into H 2 { = ({q1 > {q > {1 > = = = > {q2 ), which is a two-shift relabeling transformation, and 4 3 0 0 0 === 1 0 E 0 0 0 ··· 0 1 F F E F E .. .. E . 0 F . 1 0 0 F E H2 = E .. F .. .. .. F E . . F . . E 0 1 F E . .. F .. .. E . .. . 0 D . . . C . 0 ··· 0 1 0 0 Hence, we observe that H 2 equals the circulant matrix F with all fm = 0, except for f2 = 1. In general, H n represents a n-shift relabeling transformation, where each node label qm $ q(m+n) mod q and H n equals F with all fm = 0, except for fn = 1. Alternatively, a general circulant matrix F can be decomposed into elementary n-shift relabeling matrices H n (where H 0 = L) as F = f0 L + f1 H + f2 H 2 + fq1 H q1 =
q1 X
fn H n
n=0
Pq1 Denoting the polynomial s ({) = n=0 fn {n , we can write that F = s (H). The eigenstructure of H can be found quite elegantly. Indeed, H{ = { is equivalent to solving the set, for both and all components {n of {, {q = {1 {1 = {2 {2 = {3 .. . {q1 = {q After multiplying all equations, we find 2ln q
Qq m=1
{m = q
Qq m=1
{m , from which q = 1 2ln
, for n = 0> 1> = = = > q 1. The roots of unity n = h q obey and n = h 2ln q n = h , n n = |n |2 = 1 and, thus with (8.6) in art. 138, we obtain det H = Qq1 q1 . Any eigenvector is only determined apart from a scaling n=0 n = (1) factor, we may choose {1 = and, after backsubstitution in the set, we find that {n = 1n for all n = 1> = = = > q 1 and {q = = 1q because q = 1. Thus, the¢ ¡ 1 q+1 eigenvector of H belonging to the eigenvalue n equals 1> n > 2 n > = = = > n and the matrix [ containing the eigenvectors of H as column vectors is, with
118
Spectra of special types of graphs 2l q
=h
,
3 E E E [ = E E C
1 1 1 .. .
1 2 .. .
1 q1
1 2 4 .. .
··· ··· ···
q1 q2
q2
···
1
4 F F F F F D
where ([)nm = (n1)(m1) . We observe that [ W = [. If { and | are the eigenvectors belonging to eigenvalue n and m , respectively, then the inner product {K | (art. 150) is q q ³ q ´o X X ¡ 1o ¢ 1o 2l(mn) X 2l(mn) n {K | = {o |o = 2 m = 2 h q h q o=1 o=1 q1 X ³ 2l(mn) ´o 2 q
=
h
o=0
o=1
= 2
2l(mn)
1h
1 h
2l(mn) q
Since h2lp = 1 for any integer p, we have that {K | = 0 if n 6= m, and {K | = q2 if n = m which suggests the normalization 2 q = 1. Hence, with = s1q , we have shown that [ is a unitary matrix (art. 151), that obeys [ K [ = [[ K = L. The matrix [ is also called the Fourier matrix. The eigenvalue equation, written in terms of the matrix [, is H[ = [, where ³ ´ 2l(q1) 2l 4l 2ln = diag 1> h q > h q > = = = > h q > = = = > h q ³ ´ = diag 1> 1 > 2 > = = = > (q1) Using the unitary property results, after left multiplication of both sides by [ K , in ³ ´ [ K H[ = diag 1> 1 > 2 > = = = > (q1) and
³ ´ [ K H n [ = diag 1> n > 2n > = = = > (q1)n
Since det H 6= 0, the inverse H 1 exists and is found as ³ ´ H 1 = [diag 1> > 2 > = = = > (q1) [ K Explicitly, q q ¡ K¢ ¡ 1 ¢ 1 X 1 X (n1)(p1)+(p1)(p1)(m1) p1 [ = ([) = H np nm pm q p=1 q p=1
=
q1 1 X 2l(nm+1) p q h q p=0
=
1 1 h2l(nm+1) = 1{n=m1} q 1 h 2l(nm+1) q
5.2 A small-world graph
119
Thus, H 1 = H q1 , which corresponds to a unit-shift relabeling transformation in the other direction: 1 $ q, 2 $ 1,. . . , q $ q 1. Finally, the eigenvalue structure of a general circulant matrix F = s (H) = Pq1 n n=0 fn H is Ãq1 ! q1 X X K K n fn H [ = fn [ K H n [ [ F[ = [ n=0
=
q1 X
n=0
³ ´ fn diag 1> n > 2n > = = = > (q1)n
n=0
= diag
Ãq1 X
fn >
n=0
q1 X
fn
n
>
n=0
q1 X
fn
2n
>===>
q1 X
n=0
! fn
(q1)n
n=0
In terms of the polynomial s ({), we arrive at the eigenvalue decomposition of a general circulant matrix F, ³ ³ ´´ ¢ ¡ ¢ ¡ [ K F[ = diag s (1) > s 1 > s 2 > = = = > s (q1) (5.2)
5.2.2 The spectrum of a small-world graph The adjacency matrix DSW n of a small-world graph where each node, placed on a ring, has links to precisely n subsequent and n previous neighbors, is a symmetric circulant matrix where fQm = fm (symmetry) and f0 = 0, fm = 1{m5[1>n]} , where 1| is the indicator function. Since the degree of each node is 2n and the maximum possible degree is Q 1, the value of n is limited to 2n + 1 Q . The corresponding PQ1 polynomial is denoted as sSW n (}) = m=0 fm } m . Since f0 = 0, we have that sSW n (}) =
Q1 X
fm } m =
m=1
=
d X
d X
fm } m +
m=1
fm } m +
m=1
Q 1 X
fm } m
m=d+1
QX d1
fQ m } Q m
m=1
By symmetry fQ m = fm , the last sum is, for any integer d 5 [1> Q 1], sSW n (}) =
d X
fm } m +
QX d1
m=1
fm } Qm
m=1
When choosing d = n, the bound 2n +1 Q implies that Q d1 = Q n 1 n. Invoking fm = 1{m5[1>n]} and with d = n, we obtain sSW n (}) =
n X m=1
}m + }Q
n X
} m
m=1
1 }n 1 } n + } Q 1 =} 1} 1 } 1
120
Spectra of special types of graphs
Fig. 5.2. The complete spectrum (5.3) for Q = 101. The {-axis plots all values of n from 1 to q31 = 50, and for each n, all 1 $ p $ Q values of (S W n )p are shown. 2
The spectrum of DSW n follows for p = 1> = = = > Q from (5.2) as ¡ ¢ 1 (1p)n 1 (p1)n + (1p)(Q1) (SW n )p = sSW n 1p = 1p 1p 1 1 p1 =h
2l Q (p1)
1h
2l Q (p1)n
1h
à = 2 Re h
2l Q (p1)
2l Q (p1)
1h
+ h
2l Q (p1)
2l Q (p1)n
1h
!
³ 1h
1h
2l Q (p1)
1 h
2l Q (p1)
2l Q (p1)
After rewriting 2l Q (p1)n
2l Q (p1)n
1 h
l
= h Q (p1)(n1)
sin sin
(p1)n Q
³
(p1) Q
´
´
the eigenvalue with index p of DSW n is ³ ´4 3 l h Q (p1)(n+1) sin (p1)n Q D ³ ´ (SW n )p = 2 Re C (p1) sin Q ³ ´ (p1)n ¶ μ sin Q (p 1) (n + 1) ³ ´ cos =2 Q sin (p1) Q ³ ´ ³ ´ (p1)(2n+1) sin (p1) + sin Q Q ³ ´ = (p1) sin Q
5.2 A small-world graph Finally, the unordered1 eigenvalues of DSW n are, for 1 p Q , ³ ´ sin (p1)(2n+1) Q ³ ´ 1 (SW n )p = sin (p1) Q
121
(5.3)
The complete spectrum for Q = 101 is drawn in Fig. 5.2, which is representative for values of Q roughly above 50. Fig. 5.2 illustrates the spectral evolution (as function of¤ n in the abscissa) from a circuit (n = 1) towards the complete graph £ Q1 (n = 2 ). Applying sin ({ + q) = (1)q sin ({), valid for any integer q, we find additional symmetry in the eigenvalue spectrum, ³ ´ (p1)} sin (2n+1){Q Q ³ ´ (SW n )p = 1 = (SW n )Q +2p sin {Q (p1)} Q for 2 p Q . In we cannot deduce more symmetry because, if Q is £ general, ¤ a prime, precisely Q2 + 1 eigenvalues are distinct for any n ? Q1 2 . Theorem 5 £Q ¤ states that the diameter of JSW n is at most 2 when Q is prime. Fig. 5.3 reflects the irregular dependence of the number of dierent eigenvalues, which reminds us of the irregular structure of quantities in number theory, such as the number of divisors and the prime number factorization. The Chebyshev polynomial of the second kind (Abramowitz and Stegun, 1968, Sections 22.3.7, 22.3.16), defined by [ q2 ] sin (q + 1) arccos } X (q n)! q2n Xq (}) = = (2}) (1)n sin arccos } n! (q 2n)!
(5.4)
n=0
p has zeros at }p = cos q+1 for p = 1> = = = > q such that ¶ q μ Y p Xq (}) = 2q } cos q+1 p=1
(5.5)
In terms of the Chebyshev polynomial of the second kind, we can write (5.3) as ¶¶ μ μ (p 1) (SW n )p = X2n cos 1 Q For example, if p = 1 in (5.3), then (SW n )1 = 2n. We know that (SW n )1 is the largest eigenvalue because, for a regular graph, the maximum eigenvalue equals the degree (art. 41). Also, if 2n + 1 = Q in which case DSW n = M L, then we obtain from (5.3) lim
2n+1$Q 1
(SW n )m = 1
The p-th ordered eigenvalue (S W n )(p) , satisfying (S W n )(p) D (S W n )(p+1) , for 1 $ p ? Q, is not easy to determine as Fig. 5.2 suggests.
122
Spectra of special types of graphs 100
80
60
Number of different eigenvalues
Number of different eigenvalues
100 80 60 40 20
20
40
k
60
80
40
20
50
100 Number of nodes N
150
200
Fig. 5.3. The number of dierent eigenvalues in DS W n as a function of Q for dierent values of n = 1> 2> 3> 4> 5 and n = 10> 20> 30> 40> 50. The insert shows the number of dierent eigenvalues for Q = 200 versus n.
for all p 6= 1, while (SW n )1 = Q 1. Of course, this spectrum corresponds to that of the complete graph NQ , derived in Section 5.1. Since a small-world graph is a regular graph (art. 74), the Laplacian TSW n = 2nL DSW n and the corresponding unordered spectrum is (SW n )Q +1p = 2n (SW n )p ³ ´ sin (p1)(2n+1) Q ³ ´ = 2n + 1 (p1) sin Q As Theorem 10 prescribes, there is precisely one zero eigenvalue (SW n )Q = 0. Art. 74 demonstrates that (SW n )Q1 equals the spectral gap, the dierence between the largest and second largest eigenvalue at each n as illustrated in Fig. 5.2. Q 2Q The largest negative eigenvalue of (SW n )p lies between 2n+1 ? p 1 ? 2n+1 (2n1)Q 2n+1 ). Indeed, if [0> ), then the function i ({) = sin(2n+1){ 1 has sin { sin(2n+1){ o = , which has zeros at { = 2n+1 5 [0> ) sin { 0
(and, by symmetry p $ Q + 2 p,
2nQ 2n+1
A p1 A
and { 5 we let { = (p1) Q the same derivative as i˜({) for o = 1> 2> = = = > 2n. By Rolle’s Theorem, i ({) has always a zero in an interval between two zeros of i ({) since i ({) is continuous. Since sin { has the same sign in { 5 (0> ), the largest absolute values of i ({) will occur near { $ 0 and { $ , where sin { has zeros. A good estimate for the value at which the largest
5.3 A circuit on Q nodes negative eigenvalue occurs is half of the interval, hence, pmin = corresponding eigenvalue is, approximately, (SW n )pmin
³ sin
1 3 2(2n+1)
h
3Q 2(2n+1)
123 i + 1 . The
´ 1 ? 2
h i 3Q + 1 is, in many cases, exact. Numerical values indicate that pmin = 2(2n+1) Hence, the eigenvalues SW n of the adjacency matrix £ ¤ £ DSW n lie in¤ the interval (SW n )pmin > 2n , and most of them lie in the interval (SW n )pmin > 0 . This interval is, to a good approximation, independent of the size of the graph Q , but only a function of the degree of each node, which is 2n. The approximation fails for the complete graph NQ when 2n + 1 = Q (and thus odd) and (SW n )pmin = 1. 5.3 A circuit on Q nodes A circuit F is a ring topology where each node on a circle is connected to its previous and subsequent neighbor on the ring. Hence, the circuit is a special case of the small-world graph for n = 1. The adjacency matrix of the circuit is thus DF = H + H 1 . The eigenvalues of the circuit follow directly from (5.3) as ³ ´ sin 3 (p1) Q ³ ´ 1 (C )p = (p1) sin Q Using the identities sin 3{ = 3 sin { 4 sin3 { and 1 2 sin2 { = cos 2{ yields, for p = 1> = = = > Q , ¶ μ 2 (p 1) (5.6) (C )p = 2 cos Q which shows that (C )p = (C )Qp+2 and that 2 (C )p 2. The lower bound of 2 is only attained for Q is even. We notice that the line graph of the circuit is the circuit itself: o (F) = F. Since the number of links O = Q in the circuit F, the prefactor ( + 2)OQ in the general expression (2.9) of the characteristic polynomial of a line graph vanishes. Nevertheless, only if Q is even, this line graph o (F) still has an eigenvalue equal to 2, while all other eigenvalues are larger (art. 9). The corresponding Laplacian spectrum follows from art. 74 as ¶ μ 2 (p 1) (C )Q+1p = 2 2 cos p = 1> = = = > Q (5.7) Q The characteristic polynomial of the circuit F is ¶ ¶ ¶ ¶ μ μ Q μ Q μ Y Y 2 (p 1) 2p fC () = = 2 cos 2 cos Q Q p=1 p=1 where the last equality follows from the symmetry relation (C )p = (C )Q p . The
124
Spectra of special types of graphs
zeros of the Chebyshev polynomial Wq (}) of the first kind (Abramowitz and Stegun, 1968, Sections 22.3.6, 22.3.15), defined by
are }p
[ q2 ] qX (q n 1)! q2n Wq (}) = cos (q arccos }) = (2}) (1)n 2 n! (q 2n)! n=0 ³ ´ = cos (2p1) for p = 1> = = = > q, from which the product form 2q Wq (}) = 2q1
¶¶ μ q μ Y (2p 1) } cos 2q p=1
follows. On the other hand, the zeros of cos (q arccos })1 = 0 are }p = cos for p = 1> = = = > q. Thus, ¶ ¶ ¶ ¶ μ μ Q μ Q μ Y Y 2p 2p Q fF () = =2 2 cos cos Q Q 2 p=1 p=1
¡ 2p ¢ , q
and, in terms of the Chebyshev polynomial Wq ({) of the first kind, ¶ μ μ ¶ Q 1 WQ fF () = 2(1) 2 5.4 A path of Q 1 hops A path consisting of Q 1 hops has an adjacency matrix DS where each row has precisely one non-zero element in the upper triangular part. There exists a relabeling transformation that transforms the adjacency matrix DS of the path (line) on Q nodes in a tri-diagonal Toeplitz matrix, where each non-zero element appears on the line parallel and just above the main diagonal. The eigenstructure of the general Q × Q tri-diagonal Toeplitz matrix, 6 5 e d : 9 f e d : 9 : 9 . . . .. .. .. W =9 : : 9 7 f e d 8 f
e
is computed in Van Mieghem (2006b, Section A.5.2.1). The matrix W has Q distinct eigenvalues p , for 1 p Q , ¶ μ s p p = e + 2 df cos Q +1 The components ({p )n of the eigenvector {p belonging to p are, for 1 n Q , ¶ μ ³ f ´ n2 pn sin ({p )n = 2 d Q +1
5.4 A path of Q 1 hops
125
Since the eigenvalues are invariant under a similarity transform such as a relabeling transformation (art. 142), the complete eigenvalue and eigenvector system of DS follows, for d = f = 1 and e = 0, from the eigenstructure of the general Q × Q tri-diagonal Toeplitz matrix for p = 1> = = = Q , as μ (S )p = 2 cos
p Q +1
¶ (5.8)
Formula (5.8) shows that (S )p = (S )Q +1p and that all eigenvalues of the Q 1 hops path S are strictly smaller than 2, in particular, 2 ? (S )p ? 2. The largest eigenvalue of the path S is the smallest largest adjacency eigenvalue among any connected graph as proved by Lovász and Pelikán (1973). We provide another reasoning: Lemma 7 shows that a tree has the smallest 1 , because it is the connected graph with the minimum number of links. Further, the tree with minimum maximum degree (gmax = 2) and minimum degree variance is the path. According to the bound (3.45) and O = Q 1 in any tree, the bounds for the largest eigenvalue of the path satisfies r ¶ μ 1 6 2 1 1 (S ) 2 2 1 Q Q and the lower bound even tends to the upper bound for large Q . Any other tree has a larger variance, thus a larger lower bound in (3.45), while also the upper bound is larger than gmax A 2. The characteristic polynomial of the path is fS () =
¶ ¶ μ μ ¶ Q μ Y p = (1)Q XQ 2 cos Q + 1 2 p=1
where the Chebyshev polynomial XQ ({) of the second kind (5.5) has been used. After a suitable relabeling (as above), the Laplacian TS of an Q 1 hops path is, except for the first and last row, a Toeplitz matrix, 6
5
1 1 9 1 2 1 9 9 .. .. TS = 9 . . 9 7 1
: : : : . : 2 1 8 1 1 ..
We compute here the eigenstructure of TS analogous to the derivation of the eigenstructure of the general Q × Q tri-diagonal Toeplitz matrix in Van Mieghem (2006b, Section A.5.2.1). An eigenvector { corresponding to eigenvalue satisfies
126
Spectra of special types of graphs
(T L) { = 0 or, written per component, (1 ){1 {2 = 0 {n1 + (2 ){n {n+1 = 0
2n Q 1
{Q 1 + (1 ){Q = 0 PQ Consider the generating function J (}) = n=1 {n } n , where all {n are real because all eigenvalues of the Laplacian are real. Art. 67 demonstrates that J (1) = 0 when the eigenvector { 6= x, else the eigenvector x, where is a suitable PQ Q +1 normalization, belongs to the = 0 eigenvalue and J (}) = n=1 } n = } 1} 1} and J (1) = Q . After multiplying the n-th vector component equation by } n and summing over all n 5 [2> Q 1], the above dierence equation is transformed into }
Q 2 X
{n } n + ( 2)
n=1
Q 1 X n=2
{n } n + } 1
Q X
{n } n = 0
n=3
and, in terms of J (}), ¢ ¡ ¢ J (}){2 } 2 {1 } ¡ =0 } J (}){Q1 } Q 1 {Q } Q + (2) J (}){1 }{Q } Q + } Thus, ¢ ¡ 2 } + ( 2)} + 1 J (}) = {Q 1 } Q +1 + {Q } Q+2 + ( 2){1 } 2 + ( 2){Q } Q +1 + {2 } 2 + {1 } ¢ ¡ = (} 1) } {Q } Q {1 where in the last step the first and last vector component equation has been used. Solving for J (}) yields ¢ ¡ (} 1) } {Q } Q {1 J (}) = } 2 + ( 2)} + 1 ³ ´ {Q (} 1) } } Q {{Q1 = (} u1 ) (} u2 ) where u1 and u2 are the roots of the polynomial } 2 + ( 2)} + 1 = 0, thus obeying u1 + u2 = 2 and u1 u2 = 1. Since J (})³ is a polynomial of order Q , ´ the zeros u1 and u2 must also be zeros of (} 1) } } Q {{Q1 . Thus, u1 and u2 ³ ´1@Q 2lp must be either 0, 1 or {{Q1 h Q for p = 0> 1> = = = > Q 1. Since u1 u2 = 1, neither u1 nor u2 can be zero. If u1 = 1, then also u2 = 1 in which case = 0 ³ ´1@Q 2lp h Q = 1 to the power Q . In that and {1 = {Q as follows by raising {{Q1 Q PQ {Q } (} 1) = {Q n=1 } n such that the corresponding eigenvector is, case, J (}) = (}1) indeed, the scaled all-one vector x with = {Q . All positive eigenvalues A 0
5.4 A path of Q 1 hops 127 ³ ´1@Q 2lp correspond to distinct zeros u1 = {{Q1 h Q for p = 0> 1> 2> = = = > Q 1. But, ³ ´1@Q 2lq h Q for some since u2 = u11 , the zero u2 also must be of this form, u2 = {{Q1 0 q 6= p Q 1. Thus, the product μ u1 u2 =
{1 {Q
raised to the power Q , shows that l(2q+n)
¶2@Q h {1 {Q
2l(p+q) Q
=1
= ±1 = hln such that u1 = h
l(2p+n) Q
l(pq)
and u2 = h Q . Requiring that u2 = u11 results in u1 = h Q and u2 = l(qp) l(pq) Q Q h =h . Now, u1 changes with p, while u2 with q. For each p = 1> 2> = = = > Q 1, there must correspond to o = p q in the exponent of u1 , a value o = (p q) in u2 , only by changing q 6= p, thus q = p o. The extent over which the integer o can range is (Q 1) o Q 1 and to each o there must correspond a o. Hence, for o = 1> 2> = = = > Q 1, we finally find that ³ lo ´ lo o = 2 (u1 + u2 ) = 2 h Q + h Q μ μ ¶¶ o o = 4 sin2 = 2 1 cos Q 2Q and to o = 0, the case u1 = u2 = 1 corresponds with 0 = 0. In summary, the ordered Laplacian eigenvalues of the Q 1 hops path are ³ ³ p ´´ (P )Q p = 2 1 cos p = 0> 1> = = = > Q 1 (5.9) Q All Laplacian eigenvalues of the path are simple, while most of the circuit Laplacian eigenvalues in (5.7) have double multiplicity. We now determine the eigenvectors {1 > {2 > = = = > {Q 1 and use the notation ({p )m for the m-th component of the eigenvector {p . The eigenvector {p corresponding PQ to p = (P )Q p A 0 has the generating function Jp (}) = n=1 ({p )n } n , which equals ³ ´ ({ ) ({p )Q (} 1) } } Q ({pp) 1 ³ ´³ ´Q Jp (}) = lp lp Q Q }h }h Invoking art. 210 to the polynomial ¶ μ ({p )1 s0 (}) = ({p )Q (} 1) } } Q ({p )Q which is written as s0 (}) =
Q+2 X m=0
dm } m = ({p )Q } Q +2 ({p )Q } Q +1 ({p )1 } 2 + ({p )1 }
128
Spectra of special types of graphs
yields ; Q ? Q +2 X X
< ³ ´@ lp lp }n dm h(mn1) Q h(mn1) Q Jp (}) = lp lp > h Q h Q n=0 =m=n+1 < ; Q Q+2 ´@ ³ p 1 X? X }n (m n 1) = dm sin > = sin p Q Q 1
n=0
m=n+1
from which, for 0 n Q , ({p )n =
Q+2 ´ ³ p X 1 (m n 1) dm sin p sin Q Q m=n+1
Since ({p )0 = 0, this component relation reduces to 0=
Q +2 X
dm sin
´ ´ ³ p ³ p ´ (m 1) = ({p )Q sin (Q + 1) ({p )1 sin Q Q Q
³ p
m=1
such that ({p )Q = (1)p ({p )1 For n A 0, we have that Q+2 ´ ³ p X 1 (m n 1) d sin m sin p Q Q m=n+2 ´ ³ p ´o n ³ ({p )Q p = (Q n + 1) sin (Q n) sin sin p Q Q Q ´ ³ ´ ³ 2 ({p )Q p p = (2Q 2n + 1) cos p sin sin Q 2Q 2Q
({p )n =
Using ({p )Q = (1)p ({p )1 , we finally find the n-th component of the eigenvector {p belonging to the eigenvalue p = (P )Q p A 0, ({p )n =
´ ³ p ({p )1 (2n 1) cos cos p 2Q 2Q
A proper normalization of the eigenvectors, obeying {Wn {p = np as in art. 151, is readily obtained for 1 p Q 1 as r p 2 cos (2n 1) for 1 n Q ({p )n = Q 2Q Obviously, the eigenvector {Q =
sx Q
belonging to Q = 0 has the components
1 ({Q )m = s for 1 m Q Q
5.5 A path of k hops
129
5.5 A path of k hops A path of k A 0 hops/links in a graph with Q nodes has k non-zero rows with one non-zero element in the upper triangular part. After a similarity transform, the corresponding adjacency matrix can be transformed into " # (DS )(k+1)×(k+1) R(k+1)×(Q k1) Dk-hop path = R(Q k1)×(k+1) R(Q k1)×(Q k1) where DS is the tri-diagonal Toeplitz adjacency matrix of an k hops path in a graph with k + 1 nodes. Invoking (5.8), the spectrum of an k hops path possesses a zero eigenvalue of multiplicity Q k 1 and k + 1 eigenvalues ¶ μ n (k-hop path )n = 2 cos k+2 for n = 1> = = = > k + 1.
5.6 The wheel ZQ+1 The wheel graph ZQ+1 is the graph obtained by adding to the circuit graph one central node q with links (spokes) to each node of the circuit. Thus, the wheel graph is the cone of the circuit graph. The adjacency matrix is a special case of art. 60, ¸ DF xQ ×1 DZ = x1×Q 0 Since x is an eigenvector of DF belonging to F = 2 because the circuit is a regular graph, all eigenvalues of DF are the same as those of DZQ +1 , except for s the largest eigenvalue F = 2, which is replaced by two new ones, 1 ± 1 + Q , as derived in art. the spectrum of the wheel with Q + 1 nodes is n 60.³ Hence,´o s s 1 + Q + 1, 2 cos 2(p1) and 1 + 1 + Q . Q 2pQ
The Laplacian spectrum follows from art. 115 and (5.7) as, (W )Q +1 = 0, (W )1 = Q + 1 and ¶ μ 2 (p 1) p = 2> = = = > Q (W )Q +2p = 3 2 cos Q 5.7 The complete bipartite graph Np>q The complete bipartite graph Np>q consists of two sets M and N with p = |M| and q = |N | nodes respectively, where each node of one set is connected to all other nodes of the other set. There are no links between nodes of a same set. The adjacency matrix of Np>q is, with Q = p + q, ¸ Rp×p Mp×q DNp>q = Mq×p Rq×q
130
Spectra of special types of graphs
and the characteristic polynomial is ¡ ¢ det DNp>q L =
Lp×p Mq×p
Mp×q Lq×q
¸
Invoking (8.79) and Mn×q Mq×o = qMn×o gives ¶ μ ¡ ¢ 1 det DNp>q L = ()p det Lq×q + Mq×p Mp×q ´ ³p p M L = () det q×q ¶ μ ³ p ´q 2 = ()p det M L p q×q Using (5.1), the characteristic polynomial of Np>q is ¶ μ 2 ¶q1 μ 2 ³ p ´q ¢ ¡ q (1)q1 det DNp>q L = ()p p p ¡ 2 ¢ p+q1 p+q2 pq = (1) Q 2
and max = from which the eigenvalues2 follow as max > [0] trum reduces to that of a star topology N1>q for p = 1. The Laplacian of the complete bipartite graph Np>q is TNp>q =
qLp×p Mq×p
Mp×q pLq×q
and the characteristic polynomial is ¢ ¡ (q ) Lp×p det TNp>q L = Mq×p
s pq. This spec-
¸
Mp×q (p ) Lq×q
¸
A derivation similar to the above results in ¡ ¢ det TNp>q L = (p )q1 (q )p1 ((p ) (q ) qp) The eigenvalues of TNp>q are 0> [p]q1 > [q]p1 and p + q = Q . In the case of the star N1>q , the eigenvalues of TN1>q are 0> [1]q1 and q + 1. The complexity (Q ), the number of trees in Np>q , is found from (4.14) as Np>q (Q ) =
Q 1 1 Y n = pq1 qp1 Q n=1
and clearly, for the star where p = 1, N1>q (Q ) = 1. 2
We denote the multiplicity p of an eigenvalue by []p
5.8 A general bipartite graph
131
5.8 A general bipartite graph 5.8.1 Undirected bipartite graph Instead of connecting each of the p q nodes in the set M to each of the q nodes in the other set N , we may consider an arbitrary linking between the two sets represented by a matrix Up×q , resulting in a general bipartite graph Ep>q with adjacency matrix ¸ Rp×p Up×q DEp>q = W Uq×p Rq×q Using (8.80) when p q, the characteristic polynomial is ¶ μ ¢ ¡ 1 q W det DEp>q L = () det Lp×p + Up×q Uq×p ¢ ¡ qp W det Up×q Uq×p 2 Lp×p = () while, using (8.79) when p A q, we obtain ¢ ¢ ¡ W ¡ Up×q 2 Lq×q det DEp>q L = ()pq det Uq×p These two forms for p q and p A q are an illustration of Lemma 10. In the sequel, we confine to the case where p q without loss of generality. W The singular value decomposition of U is U = Xp×p ( U )p×q Yq×q , where U = diag(1 > = = = > p > 0> = = = > 0), because the rank of U cannot be larger than p q and where X and Y are orthonormal matrices (art. 151). From X X W = L and W UUW = Xp×p 2p×p Xp×p , we see that ¢ ¡ ¡ ¢ W ¢ ¡ W 2 Lp×p = det Xp×p 2p×p 2 L Xp×p det Up×q Uq×p p Y ¡ 2 ¢ m 2 = m=1
Hence, the spectrum of the general bipartite graph is p Y ¡ 2 ¢ ¢ ¡ m 2 det DEp>q L = (1)pq qp m=1
which show that, apart from the zero eigenvalues, it is completely determined by the singular values of U, because = ±m for m = 1> = = = > p. Since ¸ W Up×q Uq×p Rp×q D2Ep>q = W Rq×p Uq×p Up×q and, further for any integer n 1, that " ¡ ¢n W Up×q Uq×p 2n DEp>q = Rq×p
Rp×q ¡ W ¢n Uq×p Up×q
#
132
Spectra of special types of graphs
and
" D2n+1 Ep>q
=
Rp×p ¡ W ¢n W Uq×p Up×q Uq×p
# ¡ ¢n W Up×q Uq×p Up×q Rq×q
the even powers D2n Ep>q are reducible non-negative matrices (art. 167), while the odd powers again represent a “bipartite” matrix structure.
5.8.2 Directed bipartite graph A general directed bipartite graph EJ has an adjacency matrix, ¸ Rp×p Ep×q DEJ = Fq×p Rq×q
(5.10)
Any treenW onoQ = q + p nodes can be represented in the form of a levelset. (n) Denote by [Q the n-th level set of a tree W , which is the set of nodes in the tree (n)
W at hopcount n from the n root o in a graph with Q nodes, and by [Q the number (n) (0) of elements in the set [Q . Then, we have [Q = 1 because the zeroth level (n)
can only contain the root node itself. For all n A 0, it holds that 0 [Q Q 1 and that Q1 X (n) [Q = Q (5.11) n=0 (n) [Q
Nodes per level.
at a same level n are not interconnected. Fig. 5.4 draws a tree organized
Root 1
6
12
2
18
3
4
9
22
7
14
24
5
21
19
8
13
10
16
23
26
11
15
20
25
17
X N( 0)
1
X N(1)
5
X N( 2)
9
X N( 3)
7
X N( 4)
4
Fig. 5.4. An instance of a tree with Q = 26 nodes organized per level 0 $ n $ 4. The nodes in the tree are arbitrarily labeled.
5.8 A general bipartite graph
133
The levelset can be folded level by level to form a general bipartite graph. Indeed, (1) (1) the root connects to the nodes [Q at hop 1; those [Q are the ancestors of all (2) (2) the nodes on levelset [Q . We may arrange these [Q nodes at the side of the (2) (3) root. Next, these [Q are the ancestors of all [Q nodes, which we move to the (1) other side of the [Q node. In this way, all even levels are placed at the side of the root and all odd levels at the other side, thus creating a general directed bipartite graph. Hence, the adjacency matrix of any tree can be recast in the form of (5.10), P Q1 P Q2 (2n) (2n+1) 2 2 where p h= n=0 = Q p. In a stochastic setting, i [Q and q = n=0 [Q (n) where H [Q = Q Pr [KQ = n], we observe that the average multiplicity of the zero eigenvalue equals (assuming q A p) H [q p] = Q
Q1 X
n
Pr [KQ = n] (1) = Q *KQ (1)
n=0
where the probability generating function of the hopcount in a random tree is ¤ P £ Q 1 *KQ (}) = H } KQ = n=0 Pr [KQ = n] } n . ¤ £ W is an eigenvector belonging to eigenvalue , which means If {W = {F {E that ¸ ¸ ¸ ¸ Rp×p Ep×q {Fp×1 E{E {F = = Fq×p Rq×q {Eq×1 F{F {E ¤ £ W then also {W = {F {E is an eigenvector belonging to the eigenvalue , which shows that the spectrum is symmetric around = 0. The same result can be derived from (8.79) analogously to the spectrum of DEp>q above as ¢ ¡ det (DEJ L) = (1)pq qp det Ep×q Fq×p 2 Lp×p Hence, DEJ has, at least, q p zero eigenvalues. Consequently, we have demonstrated: Theorem 21 The spectrum of the adjacency matrix of any tree is symmetric around = 0 with q p zero eigenvalues.
5.8.3 Symmetry in the spectrum of an adjacency matrix D Theorem 21 can also be proven as follows. If the spectrum of D is symmetric, the characteristic polynomial fD ({) = f D ({) is even, which implies that the odd coe!cients f2n+1 of the characteristic polynomial fD ({) are all zero. Art. 29 shows that the product d1s1 d2s2 = = = dnsn of a permutation s = (s1 > s2 > = = = > sn ) of (1> 2> = = = > n) in a tree is always zero for odd n. Hence, (3.4) indicates that the spectrum of the adjacency matrix of any tree is symmetric. Indeed, the only nonzero product d1s1 d2s2 = = = dnsn in a tree is obtained when a link is traversed in both directions. Loops longer than two hops are not possible due to the tree structure and the permutation requirement for the determinant. The latter only admits paths of
134
Spectra of special types of graphs
n hops as subgraphs Jn in art. 29 because all first as well as second indices need to dierent in d1s1 d2s2 = = = dnsn (since dmm = 0). A longer (even) loop containing more than two hops will visit the intermediate nodes of the n-hop path twice, which the determinant structure does not allow. The skewness v , defined in art. 36, is zero for a tree, which again agrees with Theorem 21. We have called the spectrum of a matrix D symmetric around = 0 when, for each eigenvalue = u A 0 of D, there is an eigenvalue = u of D. The reverse of Theorem 21 is: Theorem 22 If the spectrum of an adjacency matrix D is symmetric around = 0, then the corresponding graph is a bipartite graph. Proof: Consider the adjacency matrix Rp×p D= Fq×p
Ep×q Gq×q
¸
where F = E W if the graph is undirected. Any adjacency matrix can be written in this form for p 1, because dmm = 0. The characteristic polynomial det (D L) follows from (8.79) as ¢ ¡ pq det (D L) = () det Gq×q 2 Lq×q Fq×p Ep×q The determinant on the right-hand side is only a symmetric polynomial in if G = R. In that case, D equals the adjacency matrix (5.10) of a bipartite graph. ¤
5.8.4 Laplacian spectrum of a tree We have shown in Section 5.8.2 that any tree can be represented by a general bipartite graph after properly folding the levelsets. Art. 7 indicates that the unsigned incidence matrix U and the incidence matrix E satisfy E W E = UW U, provided the (2n) links are directed from a node at an even levelset [Q to a node at an odd levelset (2n+1) [Q (or all in the opposite direction), for all levels 0 n ? Q 1. Under this condition, the relation (2.10) in art. 9 applies such that, with O = Q 1 in any tree W , ¡ ¢ m (W ) = m Do(W ) + 2 (5.12) for 1 m ? Q and Q (W ) = 0, as for any graph. Hence, the m-th Laplacian eigenvalue of a tree W equals the m-th eigenvalue of the (Q 1) ×(Q 1) adjacency matrix of its corresponding line graph o (W ). Petrovi´c and Gutman (2002) have elegantly proven that the path (with Q 1 hops) is the tree with smallest largest Laplacian eigenvalue. Their arguments are as follows. When adding a link to a graph, the Laplacian eigenvalues are nondecreasing as shown in art. 114 such that, among all connected graphs, some tree
5.9 Complete multi-partite graph
135
will have the smallest largest Laplacian, because a tree has the minimum number of links of any connected graph. Now, (5.12) shows that the smallest largest Laplacian in any tree is attained in the tree whose line graph has the smallest largest adjacency eigenvalue. This line graph has Q 1 nodes. The line graph of any tree on Q A 4 nodes possesses cycles, except for the path SQ (of Q 1 hops). Any connected cycle-containing graph J on Q 1 nodes has a spanning tree that contain