Modularity and community structure in networks.
- ISSN: 0027-8424
- ISBN: 0027-8424 (Print)\r0027-8424 (Linking)
- DOI: 10.1073/pnas.0601602103
- PubMed: 16723398
- arXiv: physics/0602124
Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as "modularity" over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets.