Stable Community Cores in Complex Networks
Complex networks are generally composed of dense sub-networks called communities. Many algorithms have been proposed to automatically detect such communities. However, they are often unstable and behave nondeterministically. We propose here to use this non-determinism in order to compute groups of nodes on which community detection algorithms agree most of the time.We show that these groups of nodes, called community cores, are more similar to Ground Truth than communities in real and artificial networks. Furthermore, we show that in contrary to the classical approaches, we can reveal the absence of community structure in random graphs.
KeywordsComplex Network Random Graph Random Network Community Detection Community Core
Unable to display preview. Download preview PDF.
- 1.Aynaud, T., Guillaume, J.: Static community detection algorithms for evolving networks. In: Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 513–519. IEEE (2010)Google Scholar
- 2.Blondel, V., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, P10,008 (2008)Google Scholar
- 6.Girvan, M., Newman, M.: Community structure in social and biological networks. In: Proceedings of the National Academy of Sciences, vol. 99(12), p. 7821 (2002)Google Scholar
- 10.Lambiotte, R.: Multi-scale modularity in complex networks. In: 2010 Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt). IEEE (2010)Google Scholar
- 13.Newman, M.: The structure of scientific collaboration networks. In: Proceedings of the National Academy of Sciences, vol. 98(2), p. 404 (2001)Google Scholar
- 16.Qinna, W., Fleury, E.: Detecting overlapping communities in graphs. In: European Conference on Complex Systems (ECCS 2009), Warwick Royaume-Uni. (2009), http://hal.inria.fr/inria-00398817/en/
- 20.Vinh, N., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 1073–1080. ACM (2009)Google Scholar
- 21.Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 452–473 (1977)Google Scholar