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

Exact analysis of generalized degree-based percolation without memory

Author

Listed:
  • Han, Jihui
  • Zhang, Ge
  • Dong, Gaogao
  • Zhao, Longfeng
  • Shi, Yuefeng
  • Zou, Yijiang

Abstract

We study the problem of generalized degree-based percolation without memory, where the probability of node removal depends on a non-negative function of node degree within the remaining network. We derive a set of nonlinear ordinary differential equations describing the evolution of the degree distribution during the percolation process. Employing generating function methods, we calculate various quantities of interest such as the probability of a randomly selected node belonging to the giant component, the mean cluster size, and the critical point at which a network transitions from connected to fragmented. Validation of our approach is achieved through extensive Monte Carlo simulations and numerical solutions. Our results indicate that removing highly connected nodes with small preference probabilities significantly lowers the critical point compared to random removal. Moreover, our analytical framework is applicable to random networks generated by the configuration model with any bounded degree distribution. It provides a comprehensive and systematic approach to analyze network robustness against various degree-based attack strategies, offering valuable insights into network design and protection.

Suggested Citation

  • Han, Jihui & Zhang, Ge & Dong, Gaogao & Zhao, Longfeng & Shi, Yuefeng & Zou, Yijiang, 2024. "Exact analysis of generalized degree-based percolation without memory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 642(C).
    • Handle: RePEc:eee:phsmap:v:642:y:2024:i:c:s0378437124002851
    DOI: 10.1016/j.physa.2024.129776
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124002851
    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.2024.129776?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. Zhang, Liwen & Xiang, Linying & Zhu, Jiawei, 2022. "Relationship between fragility and resilience in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    2. Zhao, Na & Li, Jie & Wang, Jian & Li, Tong & Yu, Yong & Zhou, Tao, 2020. "Identifying significant edges via neighborhood information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 548(C).
    3. 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.
    4. Linyuan Lü & Tao Zhou & Qian-Ming Zhang & H. Eugene Stanley, 2016. "The H-index of a network node and its relation to degree and coreness," Nature Communications, Nature, vol. 7(1), pages 1-7, April.
    5. Kolumbus, Yoav & Solomon, Sorin, 2021. "On the influence maximization problem and the percolation phase transition," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 573(C).
    6. Chen, Yiping & Paul, Gerald & Cohen, Reuven & Havlin, Shlomo & Borgatti, Stephen P. & Liljeros, Fredrik & Eugene Stanley, H., 2007. "Percolation theory and fragmentation measures in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(1), pages 11-19.
    7. 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.
    8. Peng, Hao & Qian, Cheng & Zhao, Dandan & Zhong, Ming & Han, Jianmin & Zhou, Tao & Wang, Wei, 2024. "Message-passing approach to higher-order percolation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 634(C).
    9. Gallos, Lazaros K. & Argyrakis, Panos & Bunde, Armin & Cohen, Reuven & Havlin, Shlomo, 2004. "Tolerance of scale-free networks: from friendly to intentional attack strategies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 344(3), pages 504-509.
    10. Flaviano Morone & Hernán A. Makse, 2015. "Correction: Corrigendum: Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 527(7579), pages 544-544, November.
    11. Dong, Gaogao & Luo, Yanting & Liu, Yangyang & Wang, Fan & Qin, Huanmei & Vilela, André L.M., 2022. "Percolation behaviors of a network of networks under intentional attack with limited information," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    12. Stefan Boettcher & Vijay Singh & Robert M. Ziff, 2012. "Ordinary percolation with discontinuous transitions," Nature Communications, Nature, vol. 3(1), pages 1-5, January.
    13. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    14. Tomassini, Marco, 2023. "Designing robust scale-free networks under targeted link attack using local information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 615(C).
    15. Wang, Jian & Fang, Hongying & Qin, Xiaolin, 2019. "Targeted attack on correlated interdependent networks with dependency groups," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    16. 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.
    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. 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).
    2. Yibo Dong & Jin Liu & Jiaqi Ren & Zhe Li & Weili Li, 2023. "Protecting Infrastructure Networks: Solving the Stackelberg Game with Interval-Valued Intuitionistic Fuzzy Number Payoffs," Mathematics, MDPI, vol. 11(24), pages 1-18, December.
    3. Wang, Jingjing & Xu, Shuqi & Mariani, Manuel S. & Lü, Linyuan, 2021. "The local structure of citation networks uncovers expert-selected milestone papers," Journal of Informetrics, Elsevier, vol. 15(4).
    4. Gangwal, Utkarsh & Singh, Mayank & Pandey, Pradumn Kumar & Kamboj, Deepak & Chatterjee, Samrat & Bhatia, Udit, 2022. "Identifying early-warning indicators of onset of sudden collapse in networked infrastructure systems against sequential disruptions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    5. Ping Pei & Haihan Zhang & Huizhen Zhang & Chen Yang & Tianbo An, 2024. "Network Synchronization via Pinning Control from an Attacker-Defender Game Perspective," Mathematics, MDPI, vol. 12(12), pages 1-17, June.
    6. Zhu, Weihua & Liu, Kai & Wang, Ming & Yan, Xiaoyong, 2018. "Enhancing robustness of metro networks using strategic defense," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 1081-1091.
    7. Li Zeng & Changjun Fan & Chao Chen, 2023. "Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward Shaping," Mathematics, MDPI, vol. 11(17), pages 1-13, August.
    8. Jiang, Wenjun & Fan, Tianlong & Li, Changhao & Zhang, Chuanfu & Zhang, Tao & Luo, Zong-fu, 2024. "Comprehensive analysis of network robustness evaluation based on convolutional neural networks with spatial pyramid pooling," Chaos, Solitons & Fractals, Elsevier, vol. 184(C).
    9. Tianle Pu & Li Zeng & Chao Chen, 2024. "Deep Reinforcement Learning for Network Dismantling: A K-Core Based Approach," Mathematics, MDPI, vol. 12(8), pages 1-12, April.
    10. 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).
    11. Wu, Rui-Jie & Kong, Yi-Xiu & Di, Zengru & Zhang, Yi-Cheng & Shi, Gui-Yuan, 2022. "Analytical solution to the k-core pruning process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).
    12. Wandelt, Sebastian & Lin, Wei & Sun, Xiaoqian & Zanin, Massimiliano, 2022. "From random failures to targeted attacks in network dismantling," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    13. Zhang, Dayong & Men, Hao & Zhang, Zhaoxin, 2024. "Assessing the stability of collaboration networks: A structural cohesion analysis perspective," Journal of Informetrics, Elsevier, vol. 18(1).
    14. Anwesha Sengupta & Shashankaditya Upadhyay & Indranil Mukherjee & Prasanta K. Panigrahi, 2024. "A study of the effect of influential spreaders on the different sectors of Indian market and a few foreign markets: a complex networks perspective," Journal of Computational Social Science, Springer, vol. 7(1), pages 45-85, April.
    15. Ye, Yucheng & Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan, 2022. "Forecasting countries' gross domestic product from patent data," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    16. 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).
    17. Alexandru Topîrceanu, 2022. "Benchmarking Cost-Effective Opinion Injection Strategies in Complex Networks," Mathematics, MDPI, vol. 10(12), pages 1-16, June.
    18. Kovalenko, K. & Romance, M. & Vasilyeva, E. & Aleja, D. & Criado, R. & Musatov, D. & Raigorodskii, A.M. & Flores, J. & Samoylenko, I. & Alfaro-Bittner, K. & Perc, M. & Boccaletti, S., 2022. "Vector centrality in hypergraphs," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    19. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Yi, Dongyun, 2018. "Effectively identifying multiple influential spreaders in term of the backward–forward propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 404-413.
    20. Cicchini, Tomás & Caridi, Inés & Ermann, Leonardo, 2024. "Robustness of the public transport network against attacks on its routes," Chaos, Solitons & Fractals, Elsevier, vol. 184(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:phsmap:v:642:y:2024:i:c:s0378437124002851. 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.