Finding instabilities in the community structure of complex networks

Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Nov;72(5 Pt 2):056135. doi: 10.1103/PhysRevE.72.056135. Epub 2005 Nov 29.

Abstract

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.