Convex Relaxation Methods for Community Detection
arXiv:1810.00315
Abstract
This paper surveys recent theoretical advances in convex optimization approaches for community detection. We introduce some important theoretical techniques and results for establishing the consistency of convex community detection under various statistical models. In particular, we discuss the basic techniques based on the primal and dual analysis. We also present results that demonstrate several distinctive advantages of convex community detection, including robustness against outlier nodes, consistency under weak assortativity, and adaptivity to heterogeneous degrees. This survey is not intended to be a complete overview of the vast literature on this fast-growing topic. Instead, we aim to provide a big picture of the remarkable recent development in this area and to make the survey accessible to a broad audience. We hope that this expository article can serve as an introductory guide for readers who are interested in using, designing, and analyzing convex relaxation methods in network analysis.
arXiv comment22 pages
References in corpus (11)
- Modularity and community structure in networks
- Resolution limit in community detection
- Statistical Mechanics of Community Detection
- Spectral redemption: clustering sparse networks
- Limits of modularity maximization in community detection
- Phase Transitions in Semidefinite Relaxations
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Finding Dense Clusters via "Low Rank + Sparse" Decomposition
- On the tightness of an SDP relaxation of k-means
- Semidefinite Programs for Exact Recovery of a Hidden Community
- A Grothendieck-type inequality for local maxima