Accelerating Community Detection by Using K-core Subgraphs

Abstract

Community detection is expensive, and the cost generally depends at least linearly on the number of vertices in the graph. We propose working with a reduced graph that has many fewer nodes but nonetheless captures key community structure. The K-core of a graph is the largest subgraph within which each node has at least K connections. We propose a framework that accelerates community detection by applying an expensive algorithm (modularity optimization, the Louvain method, spectral clustering, etc.) to the K-core and then using an inexpensive heuristic (such as local modularity maximization) to infer community labels for the remaining nodes. Our experiments demonstrate that the proposed framework can reduce the running time by more than 80% while preserving the quality of the solutions. Recent theoretical investigations provide support for using the K-core as a reduced representation.

15 pages, 8 figures

References in corpus (7)

• Fast unfolding of communities in large networks
• Near linear time algorithm to detect community structures in large-scale networks
• Stochastic blockmodels and community structure in networks
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• A Bayesian Approach to Network Modularity
• Clustering in complex networks. II. Percolation properties
• Empirical Comparison of Algorithms for Network Community Detection

Cited by in corpus (1)

• Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics