Skip to content

Modularity and community structure in networks.

by MEJ Newman
Proceedings of the National Academy of Sciences of the United States of America ()
Get full text at journal

Abstract

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.

Cite this document (BETA)

Readership Statistics

14 Readers on Mendeley
by Discipline
 
43% Agricultural and Biological Sciences
 
14% Engineering
 
14% Physics and Astronomy
by Academic Status
 
29% Student > Ph. D. Student
 
21% Researcher
 
21% Student > Master
by Country
 
14% United States
 
7% Spain
 
7% France

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in