摘要

In this paper, we develop a novel framework for defining radial measures of centrality in complex networks. This framework is based on the combination of two approaches: social network analysis and traditional social science approach by considering both structure of relations and individual characteristics. It is always an important issue to detect communities in complex networks as efficiently as possible to understand both the structure and function of the networks and to interpret radial centrality measures. Therefore, we propose spectral clustering by determining the best number of communities as a prerequisite stage before finding radial measures. Based on the proposed framework, an algorithm to compute the closeness centrality in complex networks is developed. We test the proposed algorithm on Zachary*s karate club network, which is considerably used as a benchmark for community detection in a network. The preliminary results indicate that the new method is efficient at detecting both good inter-cluster closeness centrality and the appropriate number of clusters.

  • 出版日期2013

全文