Department of Computer Engineering, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran
In this paper we present a centrality measurement and analysis of the social networks for finding online community. The finding of single community is commonly done using some of the centrality measures employed in social network community finding. The ability that centrality measures have to determine the relative position of a node within a network has been used in previous works to find communities in social networks using betweenness, closeness and degree centrality measures. It introduces a new metric C-path centrality, and a random algorithm for estimating it, and shows empirically that nodes with high C-path centrality have high node betweenness centrality.