Self-contained algorithms to detect communities in networks
- 116 Downloads
The investigation of community structures in networks is an important issue in many domains and disciplines. In this paper we present a new class of local and fast algorithms which incorporate a quantitative definition of community. In this way the algorithms for the identification of the community structure become fully self-contained and one does not need additional non-topological information in order to evaluate the accuracy of the results. The new algorithms are tested on artificial and real-world graphs. In particular we show how the new algorithms apply to a network of scientific collaborations both in the unweighted and in the weighted version. Moreover we discuss the applicability of these algorithms to other non-social networks and we present preliminary results about the detection of community structures in networks of interacting proteins.
KeywordsCommunity Structure Interact Protein Fast Algorithm Scientific Collaboration Weighted Version
Unable to display preview. Download preview PDF.
- 18.D. Wilkinson, B.A. Huberman, arXiv:cond-mat/0210147 (2002)Google Scholar
- 21.M.E.J. Newman, arXiv:cond-mat/0309508 (2003)Google Scholar
- 22.F. Wu, B.A. Huberman, arXiv:cond-mat/0310600 (2003)Google Scholar
- 23.S. Wasserman, K. Faust, Social Network Analysis (Cambridge Univ. Press, Cambridge, U.K., 1994)Google Scholar
- 27.B. Bollobas, Random Graphs (Academic Press, New York, 1985)Google Scholar
- 29.The comparison between the community structure in the network and the splitting of the club in two groups should be taken with care. While it is reasonable that the break-up pattern is correlated with the preexisting community structure, there is no reason to expect a perfect overlap. Therefore the misclassification of nodes is not an indication of the failure of the detection algorithmGoogle Scholar
- 32.Q. Chen, H. Chang, R. Govindn, S. Jamin, S.J. Shenker, W. Willinger, Proceedings of the 21st Annaul Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society (2002)Google Scholar
- 34.G. Caldarelli, R. Pastor-Satorras, A. Vespignani, arXiv:cond-mat/0212026 (2002)Google Scholar