Algorithmic extensions of cheeger's inequality to higher eigenvalues and partitions

  • Authors:

  • Anand Louis;Prasad Raghavendra;Prasad Tetali;Santosh Vempala

  • Affiliations:

  • College of Computing, Georgia Tech, Atlanta;College of Computing, Georgia Tech, Atlanta;School of Mathematics, Georgia Tech, Atlanta;College of Computing, Georgia Tech, Atlanta

  • Venue:
  • APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider two generalizations of the problem of finding a sparsest cut in a graph. The first is to find a partition of the vertex set into m parts so as to minimize the sparsity of the partition (defined as the ratio of the weight of edges between parts to the total weight of edges incident to the smallest m - 1 parts). The second is to find a subset of minimum sparsity that contains at most a 1/m fraction of the vertices. Our main results are extensions of Cheeger's classical inequality to these problems via higher eigenvalues of the graph. In particular, for the sparsest m-partition, we prove that the sparsity is at most 8√1-λm log m where λm is the mth largest eigenvalue of the normalized adjacency matrix. For sparsest small-set, we bound the sparsity by O(√(1-λm2)log m).