Fast unfolding of communities in large networks

By Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre. 2008

20,244 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics, Algorithms & Complexity, Network Science & Complex Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Santo Fortunato
  2. Binghui Wang
  3. Neil Zhenqiang Gong
  4. Olaf Sporns
  5. Tiago P. Peixoto
  6. Ludo Waltman
  7. Nees Jan van Eck
  8. Marc Barthelemy

In Statistical and Nonlinear Physics

  1. Olaf Sporns
  2. Santo Fortunato
  3. D. Bassett
  4. Jure Leskovec
  5. Richard F. Betzel
  6. Darko Hric
  7. M. A. Porter
  8. Ludo Waltman

In Algorithms & Complexity

  1. Olaf Sporns
  2. Ludo Waltman
  3. Nees Jan van Eck
  4. David M. Beskow
  5. M. A. Porter
  6. Marc Barthelemy
  7. Peter J. Mucha
  8. Santo Fortunato

In Network Science & Complex Systems

  1. Olaf Sporns
  2. Ludo Waltman
  3. Nees Jan van Eck
  4. Santo Fortunato
  5. Mark Newman
  6. Marc Barthelemy
  7. D. Bassett
  8. E. Bullmore

Citations in the corpus