Relative Degree Structural Hole Centrality, CRD−SH: A New Centrality Measure in Complex Networks
- 3 Downloads
In order to assess influential nodes in complex networks, the authors propose a novel ranking method based on structural hole in combination with the degree ratio of a node and its neighbors. The proposed method is a response to the limitations of other proposed measures in this field. The structural hole gives a comprehensive attention of the information about the node topology in relation to its neighbors, whereas the degree ratio of nodes reflects its significance against the neighbors. Combination of the two aforementioned measures summarized in the structural hole leverage matrix demonstrates the importance of a node according to its position in the network structure. So a more accurate method for ranking influential nodes is established. The simulation results over different-scale networks (small networks with less than 30 nodes, medium networks with less than 150 nodes and large networks with more than 1000 nodes) suggest that the proposed method can rank important nodes more effectively and precisely in complex networks specifically in larger ones.
KeywordsCentrality measures complex networks influential nodes structural hole leverage matrix
Unable to display preview. Download preview PDF.
- Chen J and Sun L, Evaluation of node importance in complex networks, Southwest Jiaotong University, 2009, 44: 426–429.Google Scholar
- Liu J G, Ren Z M, Guo Q, et al., Node importance ranking of complex networks, Acta Physica Sinica, 2013, 62(17): 178901–178901, DOI: 10.7498/aps.62.178901.Google Scholar
- Wang J W, Rong L L, and Guo T Z, A new measure method of network node importance based on local characteristics, Journal of Dalian University of Technology, 2010, 50: 822–826.Google Scholar
- Ren Z M, Shao F, Liu J G, et al., Node importance measurement based on the degree and clustering coefficient information, Acta Physica Sinica, 2013, 62(12): 505–509.Google Scholar
- Su X and Song Y, Leveraging neighborhood structural holes to identifying key spreaders in social networks, Acta Physica Sinica, 2015, 64(2): 1–11.Google Scholar
- Burt R, Structural Holes, the Social Structure of Competition, Harvard University Press, Cambridge, 1995.Google Scholar
- Knuth D E, Introduction to Combinatorial Algorithms and Boolean Functions, Addison-Wesley, New Jersey, 2008.Google Scholar
- Rossi R A and Nesreen K, The network data repository with interactive graph analytics and visualization, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.Google Scholar