Fast unfolding of communities in large networks - Archive ouverte HAL Access content directly
Journal Articles Journal of Statistical Mechanics: Theory and Experiment Year : 2008

Fast unfolding of communities in large networks

Vincent D. Blondel
  • Function : Author
Jean-Loup Guillaume
Renaud Lambiotte
  • Function : Author
Etienne Lefebvre
  • Function : Author

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.

Dates and versions

hal-01146070 , version 1 (27-04-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More