Fast unfolding of communities in large networks Export

@article{citeulike:2969578, 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. .}, archivePrefix = {arXiv}, author = {Blondel, Vincent D. and Guillaume, Jean-Loup and Lambiotte, Renaud and Lefebvre, Etienne}, citeulike-article-id = {2969578}, citeulike-linkout-0 = {http://arxiv.org/abs/0803.0476}, citeulike-linkout-1 = {http://arxiv.org/pdf/0803.0476}, citeulike-linkout-2 = {http://dx.doi.org/10.1088/1742-5468/2008/10/P10008}, day = {25}, doi = {10.1088/1742-5468/2008/10/P10008}, eprint = {0803.0476}, keywords = {community, findingcommunities, graph\_clustering}, month = {Jul}, posted-at = {2008-12-15 14:57:52}, priority = {2}, title = {Fast unfolding of communities in large networks}, url = {http://dx.doi.org/10.1088/1742-5468/2008/10/P10008}, year = {2008} }

TY - JOUR ID - citeulike:2969578 L3 - citeulike-article-id:2969578 N2 - 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. . TI - Fast unfolding of communities in large networks KW - community KW - findingcommunities KW - graph_clustering AU - Blondel, Vincent AU - Guillaume, Jean-Loup AU - Lambiotte, Renaud AU - Lefebvre, Etienne PY - 2008/Jul/25/ UR - http://dx.doi.org/10.1088/1742-5468/2008/10/P10008 ER -