1 research outputs found
Fast unfolding of communities in large networks
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
Tsurum