Fast unfolding of communities in large networks

Vincent D. Blondel Jean-Loup Guillaume 1 Renaud Lambiotte Etienne Lefebvre
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01146070
Contributor : Lip6 Publications <>
Submitted on : Monday, April 27, 2015 - 3:57:49 PM
Last modification on : Monday, December 16, 2019 - 4:02:14 PM

Links full text

Identifiers

Citation

Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, IOP Publishing, 2008, P10008, pp.1-12. ⟨10.1088/1742-5468/2008/10/P10008⟩. ⟨hal-01146070⟩

Share

Metrics

Record views

2815