Quantitative measurement and method for detecting anti-community structures in complex networks

Authors:
Bo-Lun Chen;Ling Chen;Sheng-Rong Zou;Xiu-Lian Xu
Affiliations:
Department of Computer Science, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;Department of Computer Science, Yangzhou University, Yangzhou 225009, China/ State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China;College of Physics Science and Technology, Yangzhou University, Yangzhou 225009, China;College of Physics Science and Technology, Yangzhou University, Yangzhou 225009, China
Venue:
International Journal of Wireless and Mobile Computing
Year:
2013

Citing 8
Cited 0

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Bipartite Subgraphs and the Smallest Eigenvalue

Combinatorics, Probability and Computing
Max cut and the smallest eigenvalue

Proceedings of the forty-first annual ACM symposium on Theory of computing
Empirical comparison of algorithms for network community detection

Proceedings of the 19th international conference on World wide web
Optimal coverage configuration with social emotional optimisation algorithm in wireless sensor networks

International Journal of Wireless and Mobile Computing
Privacy analysis in mobile social networks: the influential factors for disclosure of personal data

International Journal of Wireless and Mobile Computing
On routing protocols using mobile social networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many networks of interest in sciences and social research can be divided naturally into anti-communities. The problem of detecting and characterising such anti-community structure has attracted recent attention. In this paper, we first define the anti-modularity as a quantitative measure over the possible partitioning of a network. We also show that the anti-modularity can be reformulated in terms of the eigenvectors of a characteristic matrix for the network, which we call the anti-modularity matrix. Based on the anti-modularity matrix, a spectral-based algorithm for anti-community detection is proposed. We also prove that the anti-modularity matrix is identical to the covariance matrix of the column vectors in the adjacent matrix ignoring a constant factor, and our algorithm essentially accomplishes a principal component analysis on the adjacent matrix. Experimental results on synthetic and real networks show that the anti-modularity is reliable as a measurement for the anti-community partitioning, and our algorithm can effectively detect the anti-communities.