Fast algorithm for detecting community structure in networks

    Phys. Rev. E 69, 066133 – Published 18 June 2004
    M. E. J. Newman

    Abstract

    Many networks display community structure—groups of vertices within which connections are dense but between which they are sparser—and sensitive computer algorithms have in recent years been developed for detecting this structure. These algorithms, however, are computationally demanding, which limits their application to small networks. Here we describe an algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms. We give several example applications, including one to a collaboration network of more than 50 000 physicists.

    DOI: http://dx.doi.org/10.1103/PhysRevE.69.066133

    • Figure
    • Figure
    • Figure
    • Figure
    • Figure
    • Received 22 September 2003
    • Revised 22 March 2004
    • Published 18 June 2004

    © 2004 The American Physical Society

    Authors & Affiliations

    M. E. J. Newman

    • Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, Michigan 48109-1120, USA

    References

    Click to Expand

    Authorization Required


    ×
    ×

    Images

    5 of 5
    ×

    Log In

    Cancel
    ×

    Search


    Article Lookup
    Paste a citation or DOI

    Enter a citation
    ×