In Lecture 2, we used spectral partitioning to rule out the existence of a strong parallel repetition theorem for unique games. In practice, spectral methods are a very successful heuristic for graph partitioning, and in the present lecture we’ll see how to analyze these partitioning algorithms for some common families of graphs.
Balanced separators, eigenvalues, and Cheeger’s inequality
Lipton and Tarjan proved that every planar graph has a negligibly small set of nodes whose remval splits the graph into two roughly equal pieces. More specifically, every n-node planar graph can be partitioned into three disjoint sets such that there are no edges from to , the separator has at most nodes, and . This allows one to do all sorts of things, e.g. a simple divide-and-conquer algorithm gives a linear time -approximation for the maximum independent set problem in such graphs, for any .
So there is a natural question of how well spectral methods do, for example, on planar graphs. Spielman and Teng showed that for bounded-degree planar graphs, a simple recursive spectral algorithm recovers a partition of the vertex set so that . In other words, for bounded-degree planar graphs, spectral methods recover the Lipton-Tarjan separator theorem! This is proved by combining Cheeger’s inequality with their main theorem.
Theorem [Spielman-Teng]: Every n-node planar graph with maximum degree has , where is the second eigenvalue of the combinatorial Laplacian on .
Recall that we introduced the combinatorial Laplacian in Lecture 2. If is an arbitrary finite graph, in this lecture it will make more sense to think about the Laplacian as an operator on functions given by
If we define the standard inner product , then one can easily check that for any such , we have . In particular, this implies that is a positive semi-definite operator. If we denote its eigenvalues by , then it is also easy to check that , with corresponding eigenfunction for every .
Thus by standard variational principles, we have
Let us also define the Cheeger constant . For an arbitrary subset , let
note that this definition varies from the we defined in Lecture 2, because we will be discussing eigenfunctions without boundary conditions. Now one defines .
Finally, we have the version of Cheeger’s inequality (proved by Alon and Milman in the discrete setting) for graphs without boundary.
Cheeger’s inequality: If is any graph with maximum degree , then
This follows fairly easy from the Dirichlet version of Cheeger’s inequality presented in Lecture 2. Here’s a sketch: Let satisfy , and suppose, without loss of generality, that has . Define for and otherwise. Then for , so we can plug into the Dirichlet version of Cheeger’s inequality with boundary conditions on . For the full analysis, see this note which essentially follows this approach. By examining the proof, note that one can find a subset with by a simple “sweep” algorithm: Arrange the vertices so that , and output the best of the cuts .
So using the eigenvalue theorem of Spielman and Teng, along with Cheeger’s inequality, we can find a set with . While this cut has the right Cheeger constant, it is not necessarily balanced (i.e. could be very small). But one can apply this algorithm recursively, perhaps continually cutting small chunks off of the graph until a balanced cut is collected. Refer to the Spielman-Teng paper for details. A great open question is how one might use spectral information about to recover a balanced cut immediately, without the need for recursion.
Conformal mappings and circle packings
Now we focus on proving the bound for any planar graph . A natural analog is to look at what happens for the Laplace-Beltrami operator for a Riemannian metric on the 2-sphere. In fact, Hersch considered this problem almost 40 years ago and proved that , for any such Riemannian manifold . His approach was to first use the uniformization theorem to get a conformal mapping from onto , and then try to pull-back the standard second eigenfunctions on (which are just the three coordinate projections). Since the Dirichlet energy is conformally invariant in dimension 2, this almost works, except that the pulled-back map might not be orthogonal to the constant function. To fix this, he has to post-process the initial conformal mapping with an appropriate Möbius transformation.
Unaware of Hersch’s work, Spielman and Teng derived eigenvalue bounds for planar graphs using the discrete analog of this approach: Circle packings replace conformal mappings, and one still has to show the existence of an appropriate post-processing Möbius transformation.