Finding Community Structure Based on Subgraph Similarity
arXiv:0902.2425 · doi:10.1007/978-3-642-01206-8
Abstract
Community identification is a long-standing challenge in the modern network science, especially for very large scale networks containing millions of nodes. In this paper, we propose a new metric to quantify the structural similarity between subgraphs, based on which an algorithm for community identification is designed. Extensive empirical results on several real networks from disparate fields has demonstrated that the present algorithm can provide the same level of reliability, measure by modularity, while takes much shorter time than the well-known fast algorithm proposed by Clauset, Newman and Moore (CNM). We further propose a hybrid algorithm that can simultaneously enhance modularity and save computational time compared with the CNM algorithm.
ComplexNet2009, http://complenet09.diit.unict.it/index.html Will appear in "Studies in Computational Intelligence"
References in corpus (15)
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Finding community structure in very large networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Analysis of weighted networks
- Quantifying social group evolution
- Community detection in complex networks using Extremal Optimization
- Detecting fuzzy community structures in complex networks with a Potts model
- Extracting the hierarchical organization of complex systems
- Distance, dissimilarity index, and network community structure
- Collective synchronization induced by epidemic dynamics on complex networks with communities
- Synchronization on community networks
- The Role of Weight on Community Structure of Networks