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

Spatial network disintegration with heterogeneous cost

Author

Listed:
  • Shen, Xiaoda
  • Wang, Zhigang
  • Deng, Ye
  • Wu, Jun

Abstract

The problem of spatial network disintegration, such as the suppression of epidemic spread and the destabilization of terrorist networks, has garnered increasing interest. However, current methodologies often assume uniformity in disintegration costs across diverse areas, thereby simplifying the complexities of real-world scenarios. In reality, the costs of removing areas vary significantly due to geographical, economic, and structural differences. Here we draw attention to the spatial network disintegration with heterogeneous cost, where the disintegration cost to remove each area might be non-identical. We first develop a cost-constrained model based on the geospatial characteristics and introduce four typical strategies to identify crucial areas that maximize the effectiveness of the disintegration process. Experimental results on both synthetic and real-world networks indicate that while the effectiveness of the hub strategy can deteriorate under certain conditions, the average degree and leaf strategies may exhibit enhanced disintegration effects under specific parameters. This phenomenon fundamentally alters the identification of critical areas as disintegration costs transition from homogeneity to heterogeneity. These findings substantially enhance our understanding of spatial network robustness and provide a novel viewpoint for the protection of spatial networks.

Suggested Citation

  • Shen, Xiaoda & Wang, Zhigang & Deng, Ye & Wu, Jun, 2024. "Spatial network disintegration with heterogeneous cost," Chaos, Solitons & Fractals, Elsevier, vol. 187(C).
  • Handle: RePEc:eee:chsofr:v:187:y:2024:i:c:s0960077924009664
    DOI: 10.1016/j.chaos.2024.115414
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.chaos.2024.115414?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, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    2. Shi, Yan & Behrensdorf, Jasper & Zhou, Jiayan & Hu, Yue & Broggi, Matteo & Beer, Michael, 2024. "Network reliability analysis through survival signature and machine learning techniques," Reliability Engineering and System Safety, Elsevier, vol. 242(C).
    3. Wu, Baichao & Tang, Aiping & Wu, Jie, 2016. "Modeling cascading failures in interdependent infrastructures under terrorist attacks," Reliability Engineering and System Safety, Elsevier, vol. 147(C), pages 1-8.
    4. Qi, Mingze & Tan, Suoyi & Chen, Peng & Duan, Xiaojun & Lu, Xin, 2023. "Efficient network intervention with sampling information," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    5. M. E. J. Newman & D. J. Watts, 1999. "Scaling and Percolation in the Small-World Network Model," Working Papers 99-05-034, Santa Fe Institute.
    6. Rocco S, Claudio M. & Ramirez-Marquez, José Emmanuel, 2009. "Deterministic network interdiction optimization via an evolutionary approach," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 568-576.
    7. Li, Hui-Jia & Xu, Wenzhe & Song, Shenpeng & Wang, Wen-Xuan & Perc, Matjaž, 2021. "The dynamics of epidemic spreading on signed networks," Chaos, Solitons & Fractals, Elsevier, vol. 151(C).
    8. Feng, Zhidan & Song, Huimin & Qi, Xingqin, 2024. "A novel algorithm for the generalized network dismantling problem based on dynamic programming," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    9. G. Paul & T. Tanizawa & S. Havlin & H. Stanley, 2004. "Optimization of robustness of complex networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 38(2), pages 187-191, March.
    10. Li, Sheng & Liu, Wenwen & Wu, Ruizi & Li, Junli, 2023. "An adaptive attack model to network controllability," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    11. Xiao-Long Ren & Niels Gleinig & Dijana Tolić & Nino Antulov-Fantulin, 2018. "Underestimated Cost of Targeted Attacks on Complex Networks," Complexity, Hindawi, vol. 2018, pages 1-15, January.
    12. Marco Grassia & Manlio De Domenico & Giuseppe Mangioni, 2021. "Machine learning dismantling and early-warning signals of disintegration in complex systems," Nature Communications, Nature, vol. 12(1), pages 1-10, December.
    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. Deng, Ye & Wang, Zhigang & Xiao, Yu & Shen, Xiaoda & Kurths, Jürgen & Wu, Jun, 2025. "Spatial network disintegration based on spatial coverage," Reliability Engineering and System Safety, Elsevier, vol. 253(C).
    2. Feng, Zhidan & Song, Huimin & Qi, Xingqin, 2024. "A novel algorithm for the generalized network dismantling problem based on dynamic programming," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    3. Liu, Run-Ran & Chu, Changchang & Meng, Fanyuan, 2023. "Higher-order interdependent percolation on hypergraphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    4. Walter Quattrociocchi & Guido Caldarelli & Antonio Scala, 2014. "Self-Healing Networks: Redundancy and Structure," PLOS ONE, Public Library of Science, vol. 9(2), pages 1-7, February.
    5. Liu, Hao & Chen, Xin & Huo, Long & Zhang, Yadong & Niu, Chunming, 2022. "Impact of inter-network assortativity on robustness against cascading failures in cyber–physical power systems," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    6. Terrill L. Frantz & Marcelo Cataldo & Kathleen M. Carley, 2009. "Robustness of centrality measures under uncertainty: Examining the role of network topology," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 303-328, December.
    7. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    8. Wang, Wensheng & Karimi, Faezeh & Khalilpour, Kaveh & Green, David & Varvarigos, Manos, 2023. "Robustness analysis of electricity networks against failure or attack: The case of the Australian National Electricity Market (NEM)," International Journal of Critical Infrastructure Protection, Elsevier, vol. 41(C).
    9. Chen, Sai & Ding, Yueting & Zhang, Yanfang & Zhang, Ming & Nie, Rui, 2022. "Study on the robustness of China's oil import network," Energy, Elsevier, vol. 239(PB).
    10. Wang, Jianwei & Wang, Siyuan & Wang, Ziwei, 2022. "Robustness of spontaneous cascading dynamics driven by reachable area," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 585(C).
    11. Xia Cao & Chuanyun Li & Wei Chen & Jinqiu Li & Chaoran Lin, 2020. "Research on the invulnerability and optimization of the technical cooperation innovation network based on the patent perspective—A case study of new energy vehicles," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-19, September.
    12. David L. Alderson, 2008. "OR FORUM---Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher," Operations Research, INFORMS, vol. 56(5), pages 1047-1065, October.
    13. Beygelzimer, Alina & Grinstein, Geoffrey & Linsker, Ralph & Rish, Irina, 2005. "Improving network robustness by edge modification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 357(3), pages 593-612.
    14. Dong, Gaogao & Tian, Lixin & Du, Ruijin & Fu, Min & Stanley, H. Eugene, 2014. "Analysis of percolation behaviors of clustered networks with partial support–dependence relations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 370-378.
    15. Jiang, Wenjun & Li, Peiyan & Fan, Tianlong & Li, Ting & Zhang, Chuan-fu & Zhang, Tao & Luo, Zong-fu, 2024. "Scalable rapid framework for evaluating network worst robustness with machine learning," Reliability Engineering and System Safety, Elsevier, vol. 252(C).
    16. Quayle, A.P. & Siddiqui, A.S. & Jones, S.J.M., 2006. "Preferential network perturbation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 823-840.
    17. Deng, Ye & Wu, Jun & Tan, Yue-jin, 2016. "Optimal attack strategy of complex networks based on tabu search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 442(C), pages 74-81.
    18. Rui Peng & Di Wu & Mengyao Sun & Shaomin Wu, 2021. "An attack-defense game on interdependent networks," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(10), pages 2331-2341, October.
    19. Shang, Yilun, 2021. "Generalized k-cores of networks under attack with limited knowledge," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    20. Ichinose, Genki & Tsuchiya, Tomohiro & Watanabe, Shunsuke, 2021. "Robustness of football passing networks against continuous node and link removals," Chaos, Solitons & Fractals, Elsevier, vol. 147(C).

    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:187:y:2024:i:c:s0960077924009664. 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.