Relative Degree Structural Hole Centrality, CRD−SH: A New Centrality Measure in Complex Networks

Abstract

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.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    Ventresca M and Dionne A, A derandomized approximation algorithm for the critical node detection problem, Computers and Operations Research, 2014, 43: 261–270.

    MathSciNet  Article  Google Scholar 

  2. [2]

    Althoff T and Leskovec J, Online actions with offline impact: How online social networks influence online and offline user behavior, Computers and Operations Research, 2014, 43: 261–270.

    MathSciNet  Article  Google Scholar 

  3. [3]

    Lin J and Ban Y, Complex network topology of transportation systems, Transport Reviews, 2013, 33(6): 658–685.

    Article  Google Scholar 

  4. [4]

    Pagani G and Aiello M, The power grid as a complex network: A survey, Physica A: Statistical Mechanics and Its Applications, 2013, 392(11): 2688–2700.

    MathSciNet  Article  Google Scholar 

  5. [5]

    Pastor-Satorras R, Castellano C, and Mieghem P V, Epidemic processes in complex networks, Rev. Mod. Phys., 2015, 87(3): 925–980.

    MathSciNet  Article  Google Scholar 

  6. [6]

    Tang Y, Qian F, Gao H, et al., Synchronization in complex networks and its application: A survey of recent advances and challenges, Annual Reviews in Control, 2014, 38(2): 184–198.

    Article  Google Scholar 

  7. [7]

    Zhang L, Fu B, and Li Y, Cascading failure of urban weighted public transit network under single station happening emergency, Procedia Engineering, 2016, 137: 259–266.

    Article  Google Scholar 

  8. [8]

    Madar N, Kalisky T, Cohen R, et al., Immunization and epidemic dynamics in complex networks, The European Physical Journal B, 2004, 38: 269–276.

    Article  Google Scholar 

  9. [9]

    Chen J and Sun L, Evaluation of node importance in complex networks, Southwest Jiaotong University, 2009, 44: 426–429.

    Google Scholar 

  10. [10]

    Kitsak M, Gallos L V, Havlin S, et al., Identification of influential spreaders in complex networks, Nature Physics, 2010, 6: 888–893.

    Article  Google Scholar 

  11. [11]

    Chen D B, Lu L Y, Shang M S, et al., Identifying influential nodes in complex networks, Phys. A, 2012, 391: 1777–1787.

    Article  Google Scholar 

  12. [12]

    Hou B, Yao Y, and Liao D, Identifying all-around nodes for spreading dynamics in complex networks, Physica A: Statistical Mechanics and Its Applications, 2012, 391(15): 4012–4017.

    Article  Google Scholar 

  13. [13]

    Zhang X, Zhu J, Wang Q, et al., Identifying influential nodes in complex networks with community structure, Knowledged-Based Systems, 2013, 42: 74–84.

    Article  Google Scholar 

  14. [14]

    Basaras P, Katsaros D, and Tassiulas L, Detecting influential spreaders in complex, dynamic networks, IEEE Comput., 2013, 46(4): 24–29.

    Article  Google Scholar 

  15. [15]

    Zeng A and Zhang C J, Ranking spreaders by decomposing complex networks, Physics Letters A, 2013, 377(14): 1031–1035.

    Article  Google Scholar 

  16. [16]

    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 

  17. [17]

    Hu P, Fan W, and Mei S, Identifying node importance in complex networks, Physica A: Statistical Mechanics and Its Applications, 2015, 429: 169–176.

    Article  Google Scholar 

  18. [18]

    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 

  19. [19]

    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 

  20. [20]

    Liu J, Xiong Q, Shi W, et al., Evaluating the importance of nodes in complex networks, Physica A: Statistical Mechanics and Its Applications, 2016, 452(15): 209–219.

    Article  Google Scholar 

  21. [21]

    Kermarrec A M, Merrer E L, and Sericola B, Second order centrality: Distributed assessment of nodes criticity in complex networks, Computer Communications, 2011, 34: 619–628.

    Article  Google Scholar 

  22. [22]

    Bae J and Kim S, Identifying and ranking influential spreaders in complex networks by neighborhood coreness, Physica A: Statistical Mechanics and Its Applications, 2014, 395: 549–559.

    MathSciNet  Article  Google Scholar 

  23. [23]

    Liu Z, Jiang C, Wang J, et al., The node importance in actual complex networks based on a multi-attribute ranking method, Knowledge-Based Systems, 2015, 84: 56–66.

    Article  Google Scholar 

  24. [24]

    Agryzkov T, Oliver J L, Tortosa L, et al., A new betweenness centrality measure based on an algorithm for ranking the nodes of a network, Applied Mathematics and Computation, 2014, 244: 467–478.

    MathSciNet  Article  Google Scholar 

  25. [25]

    Kleinberg J M, Authoritative sources in a hyperlinked environment, Journal of the ACM, 1999, 46(5): 604–632.

    MathSciNet  Article  Google Scholar 

  26. [26]

    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 

  27. [27]

    Zhu C, Wang X, and Zhu L, A novel method of evaluating key nodes in complex networks, Chaos, Solitons and Fractals, 2017, 96: 43–50.

    Article  Google Scholar 

  28. [28]

    Kouhi Esfahani R, Shahbazi F, and Aghababaei Samani K, Noise-induced synchronization in small world networks of phase oscillators, Physical Review E, 2012, 86(3-2): 036204.

    Article  Google Scholar 

  29. [29]

    Burt R, Structural Holes, the Social Structure of Competition, Harvard University Press, Cambridge, 1995.

    Google Scholar 

  30. [30]

    Lusseau D, Schneider K, Boisseau O J, et al., The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology, 2003, 54(4): 396–405.

    Article  Google Scholar 

  31. [31]

    Knuth D E, Introduction to Combinatorial Algorithms and Boolean Functions, Addison-Wesley, New Jersey, 2008.

    Google Scholar 

  32. [32]

    Zachary W, An information flow model for conflict and fission in small groups, Journal of Anthropological Research, 1977, 33: 452–473.

    Article  Google Scholar 

  33. [33]

    Waxman B M, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617–1622.

    Article  Google Scholar 

  34. [34]

    https://doi.org/http://konect.uni-koblenz.de/networks/petster-friendships-hamster.

  35. [35]

    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 

Download references

Author information

Affiliations

Authors

Corresponding authors

Correspondence to Hamidreza Sotoodeh or Mohammed Falahrad.

Additional information

This paper was recommended for publication by Editor DI Zengru.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Sotoodeh, H., Falahrad, M. Relative Degree Structural Hole Centrality, CRD−SH: A New Centrality Measure in Complex Networks. J Syst Sci Complex 32, 1306–1323 (2019). https://doi.org/10.1007/s11424-018-7331-5

Download citation

Keywords

  • Centrality measures
  • complex networks
  • influential nodes
  • structural hole leverage matrix