IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v183y2024ics0960077924004843.html
   My bibliography  Save this article

Enhancing core–periphery robustness of networks against link-based attacks with imprecise information

Author

Listed:
  • Yang, Bo
  • Zuo, Youcheng
  • Hu, Xiaoming
  • Cheng, Weizheng
  • Li, Nuohan
  • Liu, Qi

Abstract

Core-Periphery structure, as a critical mesoscale structure, is commonly found in diverse real-world networks, in which nodes are endogenously categorized as core or peripheral nodes by the underlying interconnection patterns. It plays an important role in sustaining the intrinsic order and functional behavior of networked systems. However, despite the study on inherent core–periphery vulnerabilities to node removals, little is known on the core–periphery robustness when networks are suffering from the attacks that happen on links between nodes, especially for the more practical situations where attackers have limited ability to obtain precise network information. In this paper, a novel index is proposed for measuring the capacity of the core–periphery structure to resist link-based attacks. By introducing an attack precision parameter, we establish a unified evaluation framework for link-based attacks with imprecise information, which divides attack behaviors into localized attacks and non-localized attacks, and treats the usual random attacks and targeted attacks as the two special situations of our non-localized case. Several enhancing algorithms guided by our index with local search strategy are exquisitely devised, and experimental results are provided to demonstrate the efficacy of our framework and algorithms that remarkably improve the core–periphery robustness against link-based attacks with imprecise information.

Suggested Citation

  • Yang, Bo & Zuo, Youcheng & Hu, Xiaoming & Cheng, Weizheng & Li, Nuohan & Liu, Qi, 2024. "Enhancing core–periphery robustness of networks against link-based attacks with imprecise information," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
  • Handle: RePEc:eee:chsofr:v:183:y:2024:i:c:s0960077924004843
    DOI: 10.1016/j.chaos.2024.114932
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077924004843
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2024.114932?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. Bravard, Christophe & Charroin, Liza & Touati, Corinne, 2017. "Optimal design and defense of networks under link attacks," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 62-79.
    2. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    3. Fang, Wenyi & Wang, Xin & Liu, Longzhao & Wu, Zhaole & Tang, Shaoting & Zheng, Zhiming, 2022. "Community detection through vector-label propagation algorithms," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    4. Shahraki Ebrahimi, Ammar & Yavari, Elham & Khatibi, Toktam, 2021. "Novel methods for creating an earthquake complex network using a declustered catalog," Chaos, Solitons & Fractals, Elsevier, vol. 147(C).
    5. Maia, Hugo P. & Ferreira, Silvio C. & Martins, Marcelo L., 2023. "Controversy-seeking fuels rumor-telling activity in polarized opinion networks," Chaos, Solitons & Fractals, Elsevier, vol. 169(C).
    6. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    Full references (including those not matched with items on IDEAS)

    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. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    2. Yao, Jialing & Sun, Bingbin & Xi, lifeng, 2019. "Fractality of evolving self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 211-216.
    3. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    4. Prasanna Gai & Sujit Kapadia, 2011. "A Network Model of Super-Systemic Crises," Central Banking, Analysis, and Economic Policies Book Series, in: Rodrigo Alfaro (ed.),Financial Stability, Monetary Policy, and Central Banking, edition 1, volume 15, chapter 13, pages 411-432, Central Bank of Chile.
    5. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    6. Qingmin Hao & Jim Huangnan Shen & Chien-Chiang Lee, 2023. "Risk contagion of bank-firm loan network: evidence from China," Eurasian Business Review, Springer;Eurasia Business and Economics Society, vol. 13(2), pages 341-361, June.
    7. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    8. Gordana Apic & Matthew J Betts & Robert B Russell, 2011. "Content Disputes in Wikipedia Reflect Geopolitical Instability," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-5, June.
    9. Ying Duan & Xiuwen Fu & Wenfeng Li & Yu Zhang & Giancarlo Fortino, 2017. "Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks," Complexity, Hindawi, vol. 2017, pages 1-15, July.
    10. Gao, Bo & Deng, Zhenghong & Zhao, Dawei, 2016. "Competing spreading processes and immunization in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 93(C), pages 175-181.
    11. Li, Xin-Feng & Lu, Zhe-Ming, 2016. "Optimizing the controllability of arbitrary networks with genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 422-433.
    12. Sun, Peng Gang & Che, Wanping & Quan, Yining & Wang, Shuzhen & Miao, Qiguang, 2022. "Random networks are heterogeneous exhibiting a multi-scaling law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).
    13. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.
    14. Johan Rose Santos & Nur Diana Safitri & Maya Safira & Varun Varghese & Makoto Chikaraishi, 2021. "Road network vulnerability and city-level characteristics: A nationwide comparative analysis of Japanese cities," Environment and Planning B, , vol. 48(5), pages 1091-1107, June.
    15. Jianxi Gao & Xueming Liu & Daqing Li & Shlomo Havlin, 2015. "Recent Progress on the Resilience of Complex Networks," Energies, MDPI, vol. 8(10), pages 1-24, October.
    16. Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2020. "Properties of Entropy-Based Topological Measures of Fullerenes," Mathematics, MDPI, vol. 8(5), pages 1-23, May.
    17. Sara Meerow & Joshua P. Newell, 2015. "Resilience and Complexity: A Bibliometric Review and Prospects for Industrial Ecology," Journal of Industrial Ecology, Yale University, vol. 19(2), pages 236-251, April.
    18. Zhang, Jianhua & Zhao, Mingwei & Liu, Haikuan & Xu, Xiaoming, 2013. "Networked characteristics of the urban rail transit networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(6), pages 1538-1546.
    19. August Hämmerli & Regula Gattiker & Reto Weyermann, 2006. "Conflict and Cooperation in an Actors' Network of Chechnya Based on Event Data," Journal of Conflict Resolution, Peace Science Society (International), vol. 50(2), pages 159-175, April.
    20. Santiago, A. & Benito, R.M., 2009. "Robustness of heterogeneous complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(11), pages 2234-2242.

    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:chsofr:v:183:y:2024:i:c:s0960077924004843. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.