Skip to content

Modularity and community structure in networks

by M E J Newman
ArXiv ()
Get full text at journal

Abstract

Many networks of interest in the sciences, including a variety of social and biological networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure has attracted considerable recent attention. One of the most sensitive detection methods is optimization of the quality function known as "modularity" over the possible divisions of a network, but direct application of this method using, for instance, simulated annealing is computationally costly. Here we show that the modularity can be reformulated in terms of the eigenvectors of a new characteristic matrix for the network, which we call the modularity matrix, and that this reformulation leads to a spectral algorithm for community detection that returns results of better quality than competing methods in noticeably shorter running times. We demonstrate the algorithm with applications to several network data sets.

Cite this document (BETA)

Readership Statistics

2 Readers on Mendeley
by Discipline
 
50% Veterinary Science and Veterinary Medicine
 
50% Physics and Astronomy
by Academic Status
 
50% Professor
 
50% Student > Ph. D. Student
by Country
 
50% Brazil

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