Detecting community structure: From parsimony to weighted parsimony
- 85 Downloads
Community detection has attracted a great deal of attention in recent years. A parsimony criterion for detecting this structure means that as minimal as possible number of inserted and deleted edges is needed when we make the network considered become a disjoint union of cliques. However, many small groups of nodes are obtained by directly using this criterion to some networks especially for sparse ones. In this paper we propose a weighted parsimony model in which a weight coefficient is introduced to balance the inserted and deleted edges to ensure the obtained subgraphs to be reasonable communities. Some benchmark testing examples are used to validate the effectiveness of the proposed method. It is interesting that the weight here can be determined only by the topological features of the network. Meanwhile we make some comparison of our model with maximizing modularity Q and modularity density D on some of the benchmark networks, although sometimes too many or a little less numbers of communities are obtained with Q or D, a proper number of communities are detected with the weighted model. All the computational results confirm its capability for community detection for the small or middle size networks.
Key wordsCliques community detection complex networks parsimony
Unable to display preview. Download preview PDF.
- J. Scott, Social Network Analysis: A Handbook, 2nd ed., Sage Publications, London, 2000.Google Scholar
- S. Fortunatoa and C. Castellano, Community structure in graphs, arXiv: 0712.2716 [physics.socph], 2007.Google Scholar
- M. A. Porter, J. P. Onnela, and P. J. Mucha, Communities in networks, arXiv: 0902.3788 [physics.socph], 2009.Google Scholar
- P. Ronhovde and Z. Nussinov, Local resolution-limit-free Potts model for community detection, arXiv: 0803.2548 [physics.soc-ph], 2008.Google Scholar
- J. M. Kumpula, M. Kivelä, K. Kaski, and J. Saramäki, A sequential algorithm for fast clique percolation, arXiv: 0805.1449 [physics.soc-ph], 2008.Google Scholar
- J. Zhang, S. Zhang, and X. S. Zhang, Comparative study on a class of evaluation indices for community detection, Lecture notes in operations research, Optimization and Systems Biology, 2008, 9: 294–303.Google Scholar
- W. W. Zachary, An information flow model for conflict and fission in small groups, J. Anthropol. Res., 1977, 33: 452–473.Google Scholar