Exploiting Optimization for Local Graph Clustering

Local graph clustering methods aim to identify well-connected clusters around a given seed set of reference nodes. The main focus of prior theoretical work has been on worst-case running time properties or on implicit statistical regularization; and the focus of prior empirical work has been to identify structure in large social and information networks. Here, we adopt an optimization perspective on local graph clustering methods. In particular, we clarify the relationship between the local spectral algorithm of (Andersen, Chung and Lang, FOCS u002706) and a variant of a well-studied optimization objective. This insight permits us to develop a local spectral graph clustering algorithm that has improved theoretical convergence properties. We also demonstrate the numerical performance of this optimization-based algorithm and some heuristic variants of it.