Wow: An Algorithm for calculating community structure
MEJ Newman seems to have not only cracked the tough nut of detecting community structure in large networks but has also written the code to help the research community do it as well… Many kudos….
A. Clauset, M.E.J. Newman and C. Moore, “Finding community structure in very large networks.”
Phys. Rev. E 70, 066111 (2004).
This page documents and supports the fast modularity maximization algorithm I developed jointly with Mark Newman and Cristopher Moore. This algorithm is being widely used in the community of complex network researchers, and was originally designed for the express purpose of analyzing the community structure of extremely large networks (i.e., hundreds of thousand or millions of vertices). The original version worked only with unweighted, undirected networks. I’ve recently posted a version that works on weighted, undirected networks.
