Finding community structure in networks using the eigenvectors of matrices.

By Mark Newman. Physical review. E, Statistical, nonlinear, and soft matter physics, 2006

4,786 citations recorded by the source corpus.

We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as "modularity" over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.

Subfields: Geometry and Topology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/0250b5c0f7a414dec8c7a0aa7be20c9637eeb6ec

How researchers see this paper

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

In Geometry and Topology

  1. M. A. Porter
  2. Santo Fortunato
  3. Alex Arenas
  4. Huan Liu
  5. Lei Tang
  6. Linyuan Lu
  7. Muhan Zhang
  8. Yixin Chen

In Statistical and Nonlinear Physics

  1. Santo Fortunato
  2. Jure Leskovec
  3. M. A. Porter
  4. Mark Newman
  5. Olaf Sporns
  6. Ludo Waltman
  7. Bryan Perozzi
  8. Nees Jan van Eck

Citations in the corpus