Fast unfolding of communities in large networks

Fast unfolding of communities in large networks
复制标题

DOI:
10.1088/1742-5468/2008/10/p10008
复制
发表时间:
2008-10-01
影响因子:
2.4
通讯作者:
Lefebvre, Etienne
Lefebvre, Etienne
中科院分区:
物理与天体物理3区
文献类型:
--
作者:
Blondel, Vincent D.;Guillaume, Jean-Loup;Lefebvre, Etienne

文献摘要

被引文献

相似文献

我们提出了一个简单的方法来提取大型网络的社区结构。我们的方法是一个启发式的方法,是基于模块化优化。它优于所有其他已知的社区检测方法的计算时间。此外,从所谓的模块性衡量,所发现的社区质量非常好。这是通过识别比利时移动的电话网络中的200万客户的语言社区,并通过分析1.18亿个节点和超过10亿个链接的网络图。我们的算法的准确性也验证了ad hoc模块化网络。
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.