Name
Abstract | ||
|---|---|---|
A basic fact in algebraic graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue 1 in the normalized adjacency matrix of the graph. In particular, the graph is disconnected if and only if there are at least two eigenvalues equal to 1. Cheeger's inequality provides an "approximate" version of the latter fact, and it states that a graph has a sparse cut (it is "almost disconnected") if and only if there are at least two eigenvalues that are close to one. It has been conjectured that an analogous characterization holds for higher multiplicities, that is there are $k$ eigenvalues close to 1 if and only if the vertex set can be partitioned into $k$ subsets, each defining a sparse cut. In this paper we resolve this conjecture. Our result provides a theoretical justification for clustering algorithms that use the top $k$ eigenvector to embed the vertices into $\R^k$, and then apply geometric considerations to the embedding. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | eigenvalues,eigenvectors,adjacency matrix,connected component,data structure,higher order,algebraic graph theory |
Field | DocType | Volume |
Adjacency matrix,Discrete mathematics,Combinatorics,Spectral graph theory,Graph energy,Graph power,Null graph,Regular graph,Distance-regular graph,Mathematics,Complement graph | Journal | abs/1107.2686 |
Citations | PageRank | References |
1 | 0.40 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shayan Oveis Gharan | 1 | 323 | 26.63 |
| Luca Trevisan | 2 | 2995 | 232.34 |