Fast unfolding of communities in large networks

V.D. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre

    Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

    434 Téléchargements (Pure)

    Résumé

    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.
    langue originaleAnglais
    journalJournal of Statistical Mechanics: Theory and Experiment
    Volume2008
    Numéro de publication10
    Les DOIs
    Etat de la publicationPublié - 1 oct. 2008

    Empreinte digitale

    Examiner les sujets de recherche de « Fast unfolding of communities in large networks ». Ensemble, ils forment une empreinte digitale unique.

    Contient cette citation