We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks.
Fast unfolding of communities in large networks
V. Blondel,Jean-Loup Guillaume,R. Lambiotte,E. Lefebvre
Published 2008 in Journal of Statistical Mechanics: Theory and Experiment
ABSTRACT
PUBLICATION RECORD
- Publication year
2008
- Venue
Journal of Statistical Mechanics: Theory and Experiment
- Publication date
2008-03-04
- Fields of study
Mathematics, Physics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-32 of 32 references · Page 1 of 1