Finding instabilities in the community structure of complex networks

  • David Gfeller (Ecole Polytechnique Federale de Lausanne, Laboratoire de Biophysique Statistique, Switzerland)
A3 02 (Seminar room)


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. We introduce a method to identify the nodes lying "between clusters", allowing for a general measure of the stability of the clusters. Our method can be used with any clustering algorithm. We present several applications on real-world networks using two different clustering algorithms.