IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v490y2018icp624-631.html
   My bibliography  Save this article

Ranking influential nodes in complex networks with structural holes

Author

Listed:
  • Hu, Ping
  • Mei, Ting

Abstract

Ranking influential nodes in complex networks is of great theoretical and practical significance to ensure the safe operations of networks. In view of the important role structural hole nodes usually play in information spreading in complex networks, we propose a novel ranking method of influential nodes using structural holes called E-Burt method, which can be applied to weighted networks. This method fully takes into account the total connectivity strengths of the node in its local scope, the number of the connecting edges and the distributions of the total connectivity strengths on its connecting edges. The simulation results on the susceptible–infectious–recovered (SIR) dynamics suggest that the proposed E-Burt method can rank influential nodes more effectively and accurately in complex networks.

Suggested Citation

  • Hu, Ping & Mei, Ting, 2018. "Ranking influential nodes in complex networks with structural holes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 624-631.
    • Handle: RePEc:eee:phsmap:v:490:y:2018:i:c:p:624-631
    DOI: 10.1016/j.physa.2017.08.049
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117307847
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2017.08.049?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    2. Du, Wen-Bo & Zhou, Xing-Lian & Lordan, Oriol & Wang, Zhen & Zhao, Chen & Zhu, Yan-Bo, 2016. "Analysis of the Chinese Airline Network as multi-layer networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 108-116.
    3. Hu, Ping & Fan, Wenli & Mei, Shengwei, 2015. "Identifying node importance in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 429(C), pages 169-176.
    4. Wang, Bing & Tang, Huanwen & Guo, Chonghui & Xiu, Zhilong, 2006. "Entropy optimization of scale-free networks’ robustness to random failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 363(2), pages 591-596.
    5. Bompard, Ettore & Napoli, Roberto & Xue, Fei, 2009. "Analysis of structural vulnerabilities in power transmission grids," International Journal of Critical Infrastructure Protection, Elsevier, vol. 2(1), pages 5-12.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sun, Hong-liang & Chen, Duan-bing & He, Jia-lin & Ch’ng, Eugene, 2019. "A voting approach to uncover multiple influential spreaders on weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 303-312.
    2. Zhang, Qiang & Pu, Shunhao & Luo, Lihua & Liu, Zhichao & Xu, Jie, 2022. "Revisiting important ports in container shipping networks: A structural hole-based approach," Transport Policy, Elsevier, vol. 126(C), pages 239-248.
    3. Ma, Fei & Wang, Ping & Yao, Bing, 2021. "Random walks on Fibonacci treelike models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    2. Zhang, Xue-Jun & Xu, Guo-Qiang & Zhu, Yan-Bo & Xia, Yong-Xiang, 2016. "Cascade-robustness optimization of coupling preference in interconnected networks," Chaos, Solitons & Fractals, Elsevier, vol. 92(C), pages 123-129.
    3. Belkoura, Seddik & Cook, Andrew & Peña, José Maria & Zanin, Massimiliano, 2016. "On the multi-dimensionality and sampling of air transport networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 95-109.
    4. Pagani, Giuliano Andrea & Aiello, Marco, 2013. "The Power Grid as a complex network: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(11), pages 2688-2700.
    5. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    6. Thi-Phuong Nguyen, 2021. "Assess the Impacts of Discount Policies on the Reliability of a Stochastic Air Transport Network," Mathematics, MDPI, vol. 9(9), pages 1-13, April.
    7. Wang, Zhiru & Niu, Fangyan & Yang, Lili & Su, Guofeng, 2020. "Modeling a subway network: A hot-point attraction-driven evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    8. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    9. Elias Carroni & Paolo Pin & Simone Righi, 2020. "Bring a Friend! Privately or Publicly?," Management Science, INFORMS, vol. 66(5), pages 2269-2290, May.
    10. Gianluca Fulli & Marcelo Masera & Catalin Felix Covrig & Francesco Profumo & Ettore Bompard & Tao Huang, 2017. "The EU Electricity Security Decision-Analytic Framework: Status and Perspective Developments," Energies, MDPI, vol. 10(4), pages 1-20, March.
    11. Lordan, Oriol & Sallan, Jose M., 2019. "Core and critical cities of global region airport networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 724-733.
    12. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    13. Baek, Seung Ki & Kim, Tae Young & Kim, Beom Jun, 2008. "Testing a priority-based queue model with Linux command histories," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3660-3668.
    14. Li, Siping & Zhou, Yaoming & Kundu, Tanmoy & Zhang, Fangni, 2021. "Impact of entry restriction policies on international air transport connectivity during COVID-19 pandemic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    15. Freddy Hernán Cepeda López, 2008. "La topología de redes como herramienta de seguimiento en el Sistema de Pagos de Alto Valor en Colombia," Borradores de Economia 513, Banco de la Republica de Colombia.
    16. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    17. Xue Guo & Hu Zhang & Tianhai Tian, 2019. "Multi-Likelihood Methods for Developing Stock Relationship Networks Using Financial Big Data," Papers 1906.08088, arXiv.org.
    18. Chang, Chia-ling & Chen, Shu-heng, 2011. "Interactions in DSGE models: The Boltzmann-Gibbs machine and social networks approach," Economics Discussion Papers 2011-25, Kiel Institute for the World Economy (IfW Kiel).
    19. Lin, Yi & Zhang, Jianwei & Yang, Bo & Liu, Hong & Zhao, Liping, 2019. "An optimal routing strategy for transport networks with minimal transmission cost and high network capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 551-561.
    20. Stefano Breschi & Lucia Cusmano, 2002. "Unveiling the Texture of a European Research Area: Emergence of Oligarchic Networks under EU Framework Programmes," KITeS Working Papers 130, KITeS, Centre for Knowledge, Internationalization and Technology Studies, Universita' Bocconi, Milano, Italy, revised Jul 2002.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:490:y:2018:i:c:p:624-631. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.