Approximating the Expansion Profile and Almost Optimal Local Graph Clustering

Spectral partitioning is a simple, nearly-linear time, algorithm to find sparse cuts, and the Cheeger inequalities provide a worst-case guarantee of the quality of the approximation found by the algorithm. Local graph partitioning algorithms [1], [2], [3] run in time that is nearly linear in the size of the output set, and their approximation guarantee is worse than the guarantee provided by the Cheeger inequalities by a poly-logarithmic log
^Ω(1)
n factor. It has been an open problem to design a local graph clustering algorithm with an approximation guarantee close to the guarantee of the Cheeger inequalities and with a running time nearly linear in the size of the output. In this paper we solve this problem; we design an algorithm with the same guarantee (up to a constant factor) as the Cheeger inequality, that runs in time slightly super linear in the size of the output. This is the first sublinear (in the size of the input) time algorithm with almost the same guarantee as the Cheeger's inequality. As a byproduct of our results, we prove a bicriteria approximation algorithm for the expansion profile of any graph. Let μ(S) = Σ
_v∈S
d(v) be the volume, and φ(S) := |E(S, S̅)|/μ(S), be the conductance of a set S of vertices. If there is a set of volume at most γ and conductance φ, we can find a set of volume at most γ
^1+ϵ
and conductance V at most O(√φ/ϵ), for any ϵ >; 0. Our proof techniques also provide a simpler proof of the structural result of Arora, Barak, Steurer [4], that can be applied to irregular graphs. Our main technical tool is a lemma stating that, for any set S of vertices of a graph, a lazy t-step random walk started from a randomly chosen vertex of S, will remain entirely inside S with probability at least (1-φ(S)/2)
^t
. The lemma also implies a new lower bound to the uniform mixing time of any finite states reversible markov chain.