Community Detection Algorithm based on Centrality and Node Closeness in Scale-Free Networks

Abstract

We present a method for detecting community structures based on centrality value and node closeness. Many real world networks possess a scale-free property. This property makes community detection difficult especially on the widely used algorithms that are based on modularity optimization. However, in our algorithm, communities are formed from hub nodes. Thus communities with scale-free property can be identified correctly. The method does not contain any random element, nor requires pre-determined number of communities. Our experiments showed that our algorithm is better than algorithms based on modularity optimization in both real world and computer generated scale-free datasets.