Revealing the strong and stable community structure in social networks

Abstract

In a complex network, the global similarity standard is of high complexity and local similarity standard has biased error on node similarity. This paper puts forward a community discovering algorithm OBS, based on the degree of contribution of shared nodes in complex network. It distributes the contribution, using the degree of shared nodes as the unit, equally, which is made by shared nodes. Compared with average commute time standard, Random Walk with Restart standard and Hierarchical Structure Method standard, OBS standard has a more veracious forecast to the similar relationship between nodes. The experimental results of artificial network and typical complex network show that OBS algorithm has a better stability than GN, Fast-Newman (FN), and N-cut algorithms.