Distributed Community Detection in Large Networks
share
Community detection for large networks is a challenging task due to the high computational cost as well as the heterogeneous community structure. Stochastic block model (SBM) is a popular model to analyze community structure where nodes belonging to the same communities are connected with equal probability. Modularity optimization methods provide a fast and effective way for community detection under SBM with assortative community structure, where nodes within communities are densely connected and nodes across communities are relatively loosely connected. However, the non-assortative community structure, where nodes across communities are densely connected, widely exists in real-world networks, thus leading to the inconsistency of modularity optimization methods in applications. In this paper, we consider networks with "grouped communities" (or "the group structure"), where nodes within grouped communities are densely connected and nodes across grouped communities are relatively loosely connected, while nodes belonging to the same group but different communities can be either densely or loosely connected. We incorporate the group structure in the SBM and propose a novel divide-and-conquer algorithm to detect the community structure. We show that the proposed method can recover both the group structure and the community structure asymptotically. Numerical studies demonstrate that the proposed method can reduce the computational cost significantly while still achieving competitive performance. Further, we extend the proposed framework from the SBM to the degree-corrected SBM for more general applications.
READ FULL TEXT