On Community Detection in Very Large Networks
Community detection or graph clustering is an important problem in the analysis of computer networks, social networks, biological networks and many other natural and artificial networks. These networks are in general very large and, thus, finding hidden structures and functional modules is a very hard task. In this paper we propose new data structures and a new implementation of a well known agglomerative greedy algorithm to find community structure in large networks, the CNM algorithm. The experimental results show that the improved data structures speedup the method by a large factor, for large networks, making it competitive with other state of the art algorithms.
KeywordsRandom Graph Large Network Community Detection Bottlenose Dolphin Maximum Modularity
Unable to display preview. Download preview PDF.
- 15.Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics P10008 (2008)Google Scholar
- 17.Wakita, K., Tsurumi, T.: Finding community structure in mega-scale social networks. In: International World Wide Web Conference, pp. 1275–1276. ACM, New York (2007)Google Scholar
- 19.Danon, L., Duch, J., Diaz-Guilera, A., Arenas, A.: The effect of size heterogeneity on community identification in complex networks. Journal of Statistical Mechanics P11010 (2006)Google Scholar