Journal
PHYSICAL REVIEW E
Volume 72, Issue 5, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.72.056135
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available