Based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university, this exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. On the purely mathematical level, the eigenvalues have the advantage of being an extremely natural invariant which behaves. This book is based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university. Spectral graph theory has applications to the design and analysis of approximation algorithms for graph partitioning problems, to the study of random. I have read parts of fan chung s book and daniel spielman lecture notes. Murugaiyan pachayappan, ramakrishnan venkatesakumar. University of pennsylvania, philadelphia, pennsylvania 19104 email address. Chung defines the laplacian of a graph, a matrix closely related to the adjacency matrix, in analogy with the continuous case and studies the eigenvalues of this laplacian. Cbms regional conference series in mathematics, 1997. Here we shall concentrate mainly on the adjacency matrix of undirected graphs, and.
Since his connected we get that his bipartite and its spectrum is symmetric to. Algebraic graph theory, by chris godsil and gordon royle. Planar graphs have genus 0 sphere, disc, and annulus has genus 0 torus has genus 1 for every g, there is a class of bounded degree graphs that have no bisectors smaller than ogn. However, due to the computational demands of these approaches, applications to large problems such as spatiotemporal data and high resolution imagery have been slow to appear. In mathematics, it is a subfield that deals with the study of graphs. We have already seen the vertexedge incidence matrix, the laplacian and the adjacency matrix of a graph. And the theory of association schemes and coherent con. In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or laplacian matrix. Pdf spectral graph theory in computer science indulal. Beautifully written and elegantly presented, this book is based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university. A planar embedding g of a planar graph g can be regarded as a graph isomorphic to g. Spectral graph theory i appeared as a branch of algebraic graph theory in the 1950s and 1960s. The perronfrobenius theorem and several useful facts 156 8. Search for library items search for lists search for contacts search for a.
Graph theory is also widely used in sociology as a way, for example, to measure actors prestige or to explore rumor spreading, notably through the use of social network analysis software. Also, we use the adjacency matrix of a graph to count the number of simple paths of length up to 3. For a gallery of hundreds of these things, see the pdf linked at my bloog post, spectral realizations of graphs. I personally am partial to the normalized laplacian in which case you would want to look at spectral graph theory by chung. Chung s wellwritten exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is worth. Spectra of graphs, by andries brouwer and willem haemers. Spectral graph theory and its applications lillian dai 6. Chung s wellwritten exposition can be likened to a conversation with a good teacherone who not only gives you the facts, but tells you what is really going on, why it is. Based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university, this exposition can be likened to a conversation with a good. American mathematical society, the tricolored ams logo, and. I early work focused on using the adjacency matrix, which limited initial results to regular graphs. Notes on elementary spectral graph theory applications to. Under the umbrella of social networks are many different types of graphs. Techniques from spectral graph theory, linear and multilinear algebra, probability, approximation theory, etc.
Spectral graph theory cbms regional conference series in. Chung s wellwritten exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is. Wavelets on graphs via spectral graph theory, applied and computational harmonic analysis 30 2011 no. This is the classic book for the normalized laplacian. Chung is an expert in the field and youre probably not going to find a better book than this if youre looking to get into the concepts of the field of spectral graph theory. Any opinions, findings and conclusions or recomendations expressed in this material are those of the authors and do not necessarily reflect the views of the national science foundation nsf. Abstractspectral graph theoretic methods have recently shown great promise for the problem of image segmentation. Lecture notes semester 1 20162017 dr rachel quinlan school of mathematics, statistics and applied mathematics, nui galway.
The starting point of our approach is spectral graph theory as pioneered by fiedler 10, see also the monograph by chung 8 and the introductory articles 27, 29. I really enjoyed the topic and would like to explore it further. It is a pictorial representation that represents the mathematical truth. Chung, spectral graph theory, american mathematical.
Introduction spectral graph theory has a long history. Acquaintanceship and friendship graphs describe whether people know each other. Lectures on spectral graph theory ucsd mathematics. Algebraic graph theory is the branch of mathematics that studies graphs by using algebraic properties of associated matrices. Secondary sources 1 fan rk chung, spectral graph theory, vol. Fourier analysis on graphs norbert wiener center for. In the past, i have worked on few problems in spectral graph theory and their applications to physics.
What properties of a graph are exposedrevealed if we 1 represent the graph as. Lectures on spectral graph theory fan rk chung ucsd. However, substantial revision is clearly needed as. The following theorem is one of the fundamental results in spectral graph theory with many applications in complexity theory, coding theory, analysis of random walks, approximation algorithms, etc.
Spectral graph theory is the interplay between linear algebra and combinatorial graph theory. Lecture notes on graph theory budapest university of. Laplaces equation and its discrete form, the laplacian matrix, appear ubiquitously in mathematical physics. Dec 03, 1996 based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university, this exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. However, substantial revision is clearly needed as the list of errata got longer. In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or laplacian matrix the adjacency matrix of a simple graph is a real symmetric matrix and is therefore orthogonally diagonalizable. A good book that is available as a free pdf is spectra of graphs by brouwer and haemers. In the early days, matrix theory and linear algebra were used to analyze adjacency matrices of graphs. Chung, spectral graph theory, american mathematical society, providence, 1997. Chung s wellwritten exposition can be likened to a conversation with a. Spectral graph theory seeks to understand the interesting properties and structure of a graph by using the dominant singular values and vectors, rst recognized by fiedler 1973.
Spectral grouping using the nystrom method pattern. Algebraic graph theory cambridge mathematical library. Spectra of simple graphs owen jones whitman college may, 20 1 introduction spectral graph theory concerns the connection and interplay between the subjects of graph theory and linear algebra. Interesting questions in spectral graph theory stack exchange. The average distance and diameter of a random power law graph 143 7. A graph theory based systematic literature network analysis. Chungs wellwritten exposition can be likened to a conversation with a good teacherone who not only gives you the facts, but tells you what is really going on. But most results i see in spectral graph theory seem to concern eigenvalues not as means to an end, but as objects of interest in their own right. Complex graphs and networks university of south carolina. One must convey how the coordinates of eigenvectors correspond to vertices in a graph. Fan r k chung this book is based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university. The main objective of spectral graph theory is to relate properties of graphs with the eigenvalues and eigenvectors spectral properties of associated matrices. More in particular, spectral graph the ory studies the relation between graph properties and the spectrum of the adjacency matrix or laplace matrix. Can someone suggest interesting question or open problems.
This material is based upon work supported by the national science foundation under grant nos. For the background knowledge on mathematics and complexity theory, see preliminaries nov. Another good reference is biggs algebraic graph theory as well as godsil and royles algebraic graph theory same titles, different books. Godsil and royles algebraic graph theory is a good book too, though it has more than just spectral graph theory. These lecture notes will talk about various matrices which can be associated with a graph, like adjacency, edge adjacency and laplacian matrix. Chung, 9780821803158, available at book depository with free delivery worldwide. This book looks at the subject from a geometric point of view, exploiting an analogy between a graph and a riemannian manifold. Spectral theorem spectral theorem if ais a real symmetric n nmatrix, then each eigenvalue is real, and there is an orthonormal. Spectral graph theory american mathematical society.
Godsil and royles algebraic graph theory is a good book too, though it has more than just. Chung s spectral graph theory book focuses mostly on the normalized laplacian, but this is also good to look into. Vectors are usually taken to be column vectors unless otherwise speci ed. Chungs wellwritten exposition can be likened to a conversation with a good teacherone who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. Spectral theorem the spectrum of a matrix is the set of eigenvalues, for the this talk i will refer to the spectrum of a graph as the spectrum of the laplacian lf f is an eigenvalue, fis an eigenfunction. There are several reasons that these eigenvalues may be of interest. I personally think biggs is somewhat dated but more accesible for beginners. Spectral graph theory a book focused on the definition and development of the normalized laplacian written by fan chung, the first four chapters of the revised version are available online. Chung beautifully written and elegantly presented, this book is based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university. I always assumed that spectral graph theory extends graph theory by providing tools to prove things we couldnt otherwise, somewhat like how representation theory extends finite group theory. Introduction to spectral graph theory, cheegers inequality are the eigenvalues of ld. The basis of graph theory is in combinatorics, and the role of graphics is only in visualizing things. Spectral graph theory the faculty of mathematics and. Chungs wellwritten exposition can be likened to a conversation with a good teacherone who not only gives you the facts, but tells you what is really going on, why it is.
The dots are called nodes or vertices and the lines are called edges. The focus of spectral graph theory is to examine the eigenvalues. Eigenvalues and the laplacian of a graph, isoperimetric problems, diameters and eigenvalues, eigenvalues and quasirandomness. Due to the recent discovery of very fast solvers for these equations, they are also becoming increasingly useful in combinatorial opti. Spectral graph theory has applications to the design and analysis of approximation algorithms for graph partitioning problems, to the study of random walks in graph, and to the. A good book that is available as a free pdf is spectra of graphs by brouwer and haemers i personally am partial to the normalized laplacian in which case you would want to look at spectral graph theory by chung. Spectral graph theory studies connections between combinatorial properties of graphs and the eigenvalues of matrices associated to the graph, such as the adjacency matrix and the laplacian matrix. Spectral graph theory uri feige january 2010 1 background with every graph or digraph one can associate several di. Graph analysis provides quantitative tools for the study of complex networks. We assume that the reader is familiar with ideas from linear algebra and. Spectral graph theory tools for the analysis of complex networks. I research was independently begun in quantum chemistry, as eigenvalues of graphical representation of atoms correspond to energy levels of electrons. Important early work was done by social scientists.
The book itself can be kind of dense in the material it presents, but never overwhelmingly so. In this paper, we focus on the connection between the eigenvalues of the laplacian matrix and graph connectivity. The only downside to this book is that algebraic graph theory has moved in many new directions since the first edition the second edition mostly states some recent results at the end of each chapter, and the interested reader may want to supplement this book or follow up this book with the following. This is obvious to those who understand it, but it can take a while for students to grasp. These notes are the result of my e orts to rectify this situation. Spectral graph theory is the study of properties of the laplacian matrix or adjacency matrix associated with a graph. Graph theory is the study of relationship between the vertices nodes and edges lines. Eigenvalues and the laplacian of a graph, isoperimetric problems, diameters and. Spectral graph theory revised and improved fan chung the book was published by ams in 1992 with a second printing in 1997. Chung s wellwritten exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar. There are three tasks that one must accomplish in the beginning of a course on spectral graph theory. For instance, star graphs and path graphs are trees. In the summer of 2006, the daunting task of revision finally but surely got started.
1516 1039 248 886 744 330 313 1445 498 922 1047 197 1276 455 721 268 920 1386 690 466 688 393 854 613 384 738 1419 731 1354 1375 1191 197 291 1116 1054 386 865 770 418 288 324 767 1464 743 807 245 429 521 663