A combinatorial model and algorithm for globally searching community structure in complex networks

Authors:
Xiang-Sun Zhang;Zhenping Li;Rui-Sheng Wang;Yong Wang
Affiliations:
Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100080;School of Information, Beijing Wuzi University, Beijing, China 101149;Department of Physics, Pennsylvania State University, University Park, USA 16802;Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100080
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 5
Cited 0

A simple min-cut algorithm

Journal of the ACM (JACM)
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Some APX-completeness results for cubic graphs

Theoretical Computer Science
Clustering complex networks and biological networks by nonnegative matrix factorization with various similarity measures

Neurocomputing
On the NP-Completeness of some graph cluster measures

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Community structure is one of the important characteristics of complex networks. In the recent decade, many models and algorithms have been designed to identify communities in a given network, among which there is a class of methods that globally search the best community structure by optimizing some modularity criteria. However, it has been recently revealed that these methods may either fail to find known qualified communities (a phenomenon called resolution limit) or even yield false communities (the misidentification phenomenon) in some networks. In this paper, we propose a new model which is immune to the above phenomena. The model is constructed by restating community identification as a combinatorial optimization problem. It aims to partition a network into as many qualified communities as possible. This model is formulated as a linear integer programming problem and its NP-completeness is proved. A qualified min-cut based bisecting algorithm is designed to solve this model. Numerical experiments on both artificial networks and real-life complex networks show that the combinatorial model/algorithm has promising performance and can overcome the limitations in existing algorithms.