IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i17p2766-d1473097.html
   My bibliography  Save this article

Reinforcement Learning-Based Network Dismantling by Targeting Maximum-Degree Nodes in the Giant Connected Component

Author

Listed:
  • Shixuan Liu

    (Laboratory for Big Data and Decision, College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
    These authors contributed equally to this work.)

  • Tianle Pu

    (Laboratory for Big Data and Decision, College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
    These authors contributed equally to this work.)

  • Li Zeng

    (Laboratory for Big Data and Decision, College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
    These authors contributed equally to this work.)

  • Yunfei Wang

    (National Key Laboratory of Information Systems Engineering, College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Haoxiang Cheng

    (Laboratory for Big Data and Decision, College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Zhong Liu

    (Laboratory for Big Data and Decision, College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

Abstract

Tackling the intricacies of network dismantling in complex systems poses significant challenges. This task has relevance across various practical domains, yet traditional approaches focus primarily on singular metrics, such as the number of nodes in the Giant Connected Component (GCC) or the average pairwise connectivity. In contrast, we propose a unique metric that concurrently targets nodes with the highest degree and reduces the GCC size. Given the NP-hard nature of optimizing this metric, we introduce MaxShot, an innovative end-to-end solution that leverages graph representation learning and reinforcement learning. Through comprehensive evaluations on both synthetic and real-world datasets, our method consistently outperforms leading benchmarks in accuracy and efficiency. These results highlight MaxShot’s potential as a superior approach to effectively addressing the network dismantling problem.

Suggested Citation

  • Shixuan Liu & Tianle Pu & Li Zeng & Yunfei Wang & Haoxiang Cheng & Zhong Liu, 2024. "Reinforcement Learning-Based Network Dismantling by Targeting Maximum-Degree Nodes in the Giant Connected Component," Mathematics, MDPI, vol. 12(17), pages 1-15, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:17:p:2766-:d:1473097
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/17/2766/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/17/2766/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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).
    2. Alessandro Vespignani, 2018. "Twenty years of network science," Nature, Nature, vol. 558(7711), pages 528-529, June.
    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. Wandelt, Sebastian & Sun, Xiaoqian & Zhang, Anming, 2023. "Towards analyzing the robustness of the Integrated Global Transportation Network Abstraction (IGTNA)," Transportation Research Part A: Policy and Practice, Elsevier, vol. 178(C).
    2. Li, Jiahui & Qi, Xiaogang & He, Yi & Liu, Lifang, 2024. "SDN candidate and protection path selection for link failure protection in hybrid SDNs," Reliability Engineering and System Safety, Elsevier, vol. 244(C).
    3. Fang, Yinhai & Xu, Haiyan & Perc, Matjaž & Tan, Qingmei, 2019. "Dynamic evolution of economic networks under the influence of mergers and divestitures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 524(C), pages 89-99.
    4. 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).
    5. Chen, Wenhao & Li, Jichao & Jiang, Jiang & Chen, Gang, 2022. "Weighted interdependent network disintegration strategy based on Q-learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(C).
    6. Feng, Xiao & He, Shiwei & Li, Guangye & Chi, Jushang, 2021. "Transfer network of high-speed rail and aviation: Structure and critical components," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    7. Ana Teresa Santos & Sandro Mendonça, 2022. "The small world of innovation studies: an “editormetrics” perspective," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(12), pages 7471-7486, December.
    8. Chulwook Park, 2019. "Network and Agent Dynamics with Evolving Protection against Systemic Risk," Papers 1907.11622, arXiv.org.
    9. Rong, Qingnan & Zhang, Jun & Sun, Xiaoqian & Wandelt, Sebastian, 2022. "On the estimation of percolation thresholds for real networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    10. Iacopo Iacopini & Márton Karsai & Alain Barrat, 2024. "The temporal dynamics of group interactions in higher-order social networks," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    11. Boeing, Geoff, 2020. "Street Network Models and Indicators for Every Urban Area in the World," SocArXiv f2dqc, Center for Open Science.
    12. Carlo Mari & Cristiano Baldassari, 2023. "Optimization of mixture models on time series networks encoded by visibility graphs: an analysis of the US electricity market," Computational Management Science, Springer, vol. 20(1), pages 1-23, December.
    13. Boeing, Geoff, 2019. "Street Network Models and Measures for Every U.S. City, County, Urbanized Area, Census Tract, and Zillow-Defined Neighborhood," SocArXiv 7fxjz, Center for Open Science.
    14. Zhang, Jiarui & Tang, Bin & Duan, Yuxian & Huang, Jian, 2023. "Percolation phase transition in the heterogeneous multi-coupled interdependent network," Chaos, Solitons & Fractals, Elsevier, vol. 174(C).
    15. Hu, Jie & Wen, Weiping & Zhai, Changhai & Pei, Shunshun, 2024. "Post-earthquake functionality assessment for urban subway systems: Incorporating the combined effects of seismic performance of structural and non-structural systems and functional interdependencies," Reliability Engineering and System Safety, Elsevier, vol. 241(C).
    16. Daniel Röchert & Manuel Cargnino & German Neubaum, 2022. "Two sides of the same leader: an agent-based model to analyze the effect of ambivalent opinion leaders in social networks," Journal of Computational Social Science, Springer, vol. 5(2), pages 1159-1205, November.

    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:gam:jmathe:v:12:y:2024:i:17:p:2766-:d:1473097. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.