Year: 2005
Type: article
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.
Source: Physical Review E
Institution: École Polytechnique Fédérale de Lausanne
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1967752035
