Some applications of Laplace eigenvalues of graphs

In the last decade important relations between Laplace eigenvalues and eigenvectors of graphs and several other graph parameters were discovered. In these notes we present some of these results and discuss their consequences. Attention is given to the partition and the isoperimetric properties of graphs, the max-cut problem and its relation to semidefinite programming, rapid mixing of Markov chains, and to extensions of the results to infinite graphs.

[1]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[2]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[3]  Erling Følner,et al.  On groups with full Banach mean value , 1955 .

[4]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[5]  Tosio Kato.  Perturbation theory for linear operators , 1966 .

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[7]  H. Wilf.  The Eigenvalues of a Graph and Its Chromatic Number , 1967 .

[8]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[9]  A. J. Hoffman,et al.  ON EIGENVALUES AND COLORINGS OF GRAPHS, II , 1970 .

[10]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[11]  J. P. Williams,et al.  On the essential numerical range, the essential spectrum, and a problem of Halmos , 1972 .

[12]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[13]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[14]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[15]  Compact Perturbations, Normal Eigenvalues and a Problem of Salinas , 1974 .

[16]  Joseph Rosenblatt,et al.  Invariant measures and growth conditions , 1974 .

[17]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[18]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[21]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[22]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[23]  Michael Doob,et al.  Spectra of graphs , 1980 .

[24]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[25]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[26]  J. Pier,et al.  Amenable Locally Compact Groups , 1984 .

[27]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[28]  I. Chavel.  Eigenvalues in Riemannian geometry , 1984 .

[29]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[30]  N. Varopoulos.  Isoperimetric inequalities and Markov chains , 1985 .

[31]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[32]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[33]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[34]  Fan Chung Graham,et al.  The forwarding index of communication networks , 1987, IEEE Trans. Inf. Theory.

[35]  Computing the volume is difficult , 1987, Discret. Comput. Geom..

[36]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[37]  Peter Gerl.  Random walks on graphs with a strong isoperimetric property , 1988 .

[38]  B. Mohar.  Isoperimetric inequalities, growth, and the spectrum of graphs , 1988 .

[39]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[40]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[41]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[42]  B. Mohar,et al.  A Survey on Spectra of infinite Graphs , 1989 .

[43]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[44]  M. Fiedler.  Laplacian of graphs and algebraic connectivity , 1989 .

[45]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[46]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

[47]  Pravin M. Vaidya,et al.  A new algorithm for minimizing convex functions over convex sets , 1989, 30th Annual Symposium on Foundations of Computer Science.

[48]  Miklós Simonovits,et al.  The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[49]  B. Mohar,et al.  Eigenvalues and the max-cut problem , 1990 .

[50]  Wolfgang Woess,et al.  Amenability, unimodularity, and the spectral radius of random walks on infinite graphs , 1990 .

[51]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

[52]  Bojan Mohar,et al.  Some relations between analytic and geometric properties of infinite graphs , 1991, Discret. Math..

[53]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[54]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[55]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[56]  P. A. D. DeMaine,et al.  Integrated Systems , 1991 .

[57]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[58]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[59]  Franz Rendl,et al.  Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem , 1992, Math. Program..

[60]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[61]  C. Thomassen.  Trees, Ends, and Transience , 1992 .

[62]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..

[63]  Robert Brooks.  Spectral Geometry and the Cheeger Constant , 1992, Expanding Graphs.

[64]  P. Diaconis,et al.  Trailing the Dovetail Shuffle to its Lair , 1992 .

[65]  P. Buser,et al.  Geometry and Spectra of Compact Riemann Surfaces , 1992 .

[66]  Bojan Mohar,et al.  Laplace eigenvalues and bandwidth-type invariants of graphs , 1993, J. Graph Theory.

[67]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[68]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[69]  B. Mohar,et al.  Eigenvalues in Combinatorial Optimization , 1993 .

[70]  Franz Rendl,et al.  A spectral approach to bandwidth and separator problems in graphs , 1993, IPCO.

[71]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[72]  Charles Delorme,et al.  Combinatorial Properties and the Complexity of a Max-cut Approximation , 1993, Eur. J. Comb..

[73]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[74]  Ravi Kannan,et al.  Markov chains and polynomial time algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[75]  Martine D. F. Schlag,et al.  Spectral K-way ratio-cut partitioning and clustering , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[76]  Donald E. Knuth.  The Sandwich Theorem , 1994, Electron. J. Comb..

[77]  Alexander Lubotzky,et al.  Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.

[78]  Wolfgang Woess,et al.  Random Walks on Infinite Graphs and Groups — a Survey on Selected topics , 1994 .

[79]  Jeffrey S. Rosenthal,et al.  Convergence Rates for Markov Chains , 1995, SIAM Rev..

[80]  Patrick Solé,et al.  Expanding and Forwarding , 1995, Discret. Appl. Math..

[81]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[82]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[83]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[84]  Franz Rendl,et al.  Nonpolyhedral Relaxations of Graph-Bisection Problems , 1995, SIAM J. Optim..

[85]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[86]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[87]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[88]  Shang-Hua Teng,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[89]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[90]  J. Gross,et al.  Graph Theory and Its Applications , 1998 .

[91]  Fan Chung Graham,et al.  Isoperimetric Inequalities for Cartesian Products of Graphs , 1998, Comb. Probab. Comput..