Finding instabilities in the community structure of complex networks.

By David Gfeller, Jean-Cédric Chappelier, P. De Los Rios. 2005

125 citations recorded by the source corpus.

The problem of finding clusters in complex networks has been studied by mathematicians, computer scientists, and, more recently, by physicists. Many of the existing algorithms partition a network into clear clusters without overlap. Here we introduce a method to identify the nodes lying "between clusters," allowing for a general measure of the stability of the clusters. This is done by adding noise over the edge weights. Our method can in principle be used with almost any clustering algorithm able to deal with weighted networks. We present several applications on real-world networks using two different clustering algorithms.

Subfields: Artificial Intelligence, Statistical and Nonlinear Physics

How researchers see this paper

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

In Artificial Intelligence

  1. Olaf Sporns
  2. Richard F. Betzel
  3. Jean-Baptiste Rouquier
  4. Santo Fortunato
  5. Claudio Castellano
  6. Giulio Tononi
  7. Darko Hric

In Statistical and Nonlinear Physics

  1. Olaf Sporns
  2. Richard F. Betzel
  3. Santo Fortunato
  4. Claudio Castellano
  5. Jean-Baptiste Rouquier
  6. Ivan Junier
  7. Massoud Seifi
  8. Jean-Loup Guillaume

Citations in the corpus