Dissemin is shutting down on January 1st, 2025

Published in

IOP Publishing, Journal of Statistical Mechanics: Theory and Experiment, 10(2008), p. P10008

DOI: 10.1088/1742-5468/2008/10/p10008

Links

Tools

Export citation

Search in Google Scholar

Fast unfolding of communities in large networks

Journal article published in 2008 by Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte ORCID, Etienne Lefebvre
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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 method 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.6 million customers and by analyzing 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. . ; Comment: 6 pages, 5 figures, 1 table; new version with new figures in order to clarify our method, where we look more carefully at the role played by the ordering of the nodes and where we compare our method with that of Wakita and Tsurumi