Real world networks often have nodes belonging to multiple communities. While traditional community detection methods focus on non-overlapping communities (where a node can belong to exactly one community), the problem of finding overlapping communities has gained attention recently. While provably consistent algorithms exists, they either make assumptions about the population that are hard to check \citep{zhang2014detecting}, or are too computationally expensive \citep{MMSBAnandkumar2014}. We consider the detection of overlapping communities under the popular Mixed Membership Stochastic Blockmodel (MMSB) \cite{airoldi2008mixed}. Using the inherent geometry of this model, we link the inference of overlapping communities to the problem of finding corners in a noisy rotated and scaled simplex, for which consistent algorithms exist \citep{gillis2014fast}. We use this as a building block for our algorithm to infer the community memberships of each node, and prove its consistency. As a byproduct of our analysis, we derive sharp row-wise eigenvector deviation bounds, and provide a cleaning step that improves the performance drastically for sparse networks. We also propose both necessary and sufficient conditions for identifiability of the model, while existing methods typically present sufficient conditions for identifiability of the model involved. The empirical performance of our method is shown using simulated and real datasets scaling up to 100,000 nodes.
View on arXiv