Modularity and community structure in networks.

By Mark Newman. 2006

12,290 citations recorded by the source corpus.

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.

Subfields: Molecular Biology, Statistical and Nonlinear Physics, Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Molecular Biology

  1. Santo Fortunato
  2. Olaf Sporns
  3. Jure Leskovec
  4. Ludo Waltman
  5. Nees Jan van Eck
  6. E. Bullmore
  7. D. Bassett
  8. M. A. Porter

In Statistical and Nonlinear Physics

  1. Santo Fortunato
  2. Jure Leskovec
  3. Olaf Sporns
  4. Mark Newman
  5. M. A. Porter
  6. Darko Hric
  7. Alex Arenas
  8. Richard F. Betzel

In Graph Learning

  1. Jure Leskovec
  2. Bryan Perozzi
  3. Chengqi Zhang
  4. William L. Hamilton
  5. Stephan Günnemann
  6. Peng Cui
  7. Wenwu Zhu
  8. Huan Liu

Citations in the corpus