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.

Keywords

Modularity (biology)Computer scienceHeuristicComputationModular designSimple (philosophy)GraphMobile phoneCommunity structurePhoneTheoretical computer scienceDistributed computingData scienceData miningArtificial intelligenceAlgorithmTelecommunicationsMathematics

Affiliated Institutions

Related Publications

Modularity and community structure in networks

M. E. J. Newman

Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or...

2006 Proceedings of the National Academy o... 11783 citations

Publication Info

Year
2008
Type
article
Volume
2008
Issue
10
Pages
P10008-P10008
Citations
19995
Access
Closed

External Links

Download PDF (Free) View on DOI.org arXiv Semantic Scholar

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

19995
OpenAlex
1692
Influential

Cite This

Vincent D. Blondel, Jean‐Loup Guillaume, Renaud Lambiotte et al. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics Theory and Experiment , 2008 (10) , P10008-P10008. https://doi.org/10.1088/1742-5468/2008/10/p10008

Identifiers

DOI
10.1088/1742-5468/2008/10/p10008
arXiv
0803.0476

Data Quality

Data completeness: 84%