Abstract

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.

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
1567	Randomized Algorithms - Motwani, Raghavan - 1995
1420	An Introduction to Probability Theory and Its Applications - Feller - 1968
1305	Perturbation theory for linear operators - Kato - 1985
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
605	Proof Verification and the Hardness of Approximation Problems - Arora, Lund, et al. - 1998
539	A new polynomial-time algorithm for linear programming - Karmarkar - 1984
422	Interior-point methods in semidefinite programming with applications to combinatorial optimization - Alizadeh - 1995
306	A polynomial algorithm in linear programming, Doklady Akad - Khachiyan - 1979
294	Algebraic connectivity of graphs - Fiedler - 1973
289	Eigenvalues and expanders - Alon - 1986
281	On the Shannon capacity of a graph - Lovász
262	Partitioning of unstructured problems for parallel processing - Simon - 1991
258	J.L.: Random walks and electric networks - Doyle, Snell - 1984
257	Approximating the Permanent - Jerrum, Sinclair - 1989
254	A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems.In - Barnard, Simon - 1993
233	Geometric bounds for eigenvalues of Markov chains,” The Annals of Applied Probability - Diaconis, Stroock - 1991
232	Eigenvalues in Riemannian Geometry - Chavel - 1984
216	Approximate counting, uniform generation and rapidly mixing Markov chains - Sinclair, Jerrum - 1989
187	A property of eigenvectors of non-negative symmetric matrices and its application to graph theory - Fiedler - 1975
170	New spectral methods for ratio cut partitioning and clustering - Hagen, Kahng - 1992
166	Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkhäuser - Sinclair - 1993
160	An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations - Hendrickson, Leland
159	lower bound for the smallest eigenvalue of the Laplacian - Cheeger, “A - 1970
154	Approximate graph coloring by semidefinite programming - Karger, Motwani, et al. - 1994
147	Performance of Dynamic Load-Balancing Algorithms for Unstructured Mesh - Williams - 1991
146	Discrete groups, expanding graphs and invariant measures, with an appendix by Jonathan D. Rogawski. Reprint of the 1994 edition. Modern Birkhäuser Classics. Birkhäuser Verlag - Lubotzky - 2010
143	Geometry and Spectra of Compact Riemann Surfaces (Birkhäuser - Buser - 1992
143	Improved Approximation Algorithms for MAX k-CUT - Frieze, Jerrum - 1997
141	Spectra of Graphs - Cvetkovic, Doob, et al. - 1980
127	Lower bounds for partitioning of graphs - Donath, Homan - 1973
125	Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT - Feige, Goemans - 1995
124	Spectral partitioning works: Planar graphs and finite element meshes - Spielman, Teng - 1996
111	A new algorithm for minimizing convex functions over convex sets - Vaidya - 1996
104	Random walks in a convex body and an improved volume algorithm. Random Structures Algorithms - Lovász, Simonovits - 1993
99	A random polynomialtime algorithm for approximating the volume of convex bodies - Dyer, Frieze, et al. - 1991
87	Generating a random permutation with random transpositions - Diaconis, Shahshahani - 1981
81	A theorem on trees - Cayley
66	1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
62	How hard is to marry at random? (On the approximation of the permanent - Broder - 1986
59	Isoperimetric numbers of graphs - Mohar - 1989
58	Convergence rates of Markov chains - Rosenthal - 1995
54	The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, preprint - Lovász, Simonovits - 1990
52	Eigenvalues and Graph Bisection: An Average Case Analysis - Boppana - 1987
52	Optimal linear labelings and eigenvalues of graphs - Juvan, Mohar - 1992
48	Laplacian eigenvalues and the maximum cut problem - Delorme, Poljak - 1990
48	Markov chains and polynomial time algorithms - Kannan - 1994
46	Cayley graphs and interconnection networks - Heydemann - 1997
42	Quadratic assignment problem - Finke, Burkard, et al. - 1987