Detecting the Structural Hole for Social Communities Based on Conductance–Degree

Abstract

It has been shown that identifying the structural holes in social networks may help people analyze complex networks, which is crucial in community detection, diffusion control, viral marketing, and academic activities. Structural holes bridge different communities and gain access to multiple sources of information flow. In this paper, we devised a structural hole detection algorithm, known as the Conductance–Degree structural hole detection algorithm (CD-SHA), which computes the conductance and degree score of a vertex to identify the structural hole spanners in social networks. Next, we proposed an improved label propagation algorithm based on conductance (C-LPA) to filter the jamming nodes, which have a high conductance and degree score but are not structural holes. Finally, we evaluated the performance of the algorithm on different real-world networks, and we calculated several metrics for both structural holes and communities. The experimental results show that the algorithm can detect the structural holes and communities accurately and efficiently.