Modularity and community structure in networks
Mark E. J. Newman · Proceedings of the National Academy of Sciences · 2006
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.
Cited by 12,158 works. doi:10.1073/pnas.0601602103 Open-access PDF
Authors
References
- Collective dynamics of ‘small-world’ networks
- Emergence of Scaling in Random Networks
- Statistical mechanics of complex networks
- Social Network Analysis
- An Efficient Heuristic Procedure for Partitioning Graphs
- The Structure and Function of Complex Networks
- Spectral Graph Theory
- Community structure in social and biological networks
- Social Network Analysis
- Finding and evaluating community structure in networks