Preprint Article Version 1 This version is not peer-reviewed

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

Version 1 : Received: 19 August 2024 / Approved: 19 August 2024 / Online: 20 August 2024 (09:25:05 CEST)

How to cite: Liu, S.; Pu, T.; Zeng, L.; Wang, Y.; Cheng, H.; Liu, Z. Reinforcement Learning-based Network Dismantling by Targeting Maximum Degree Nodes in the Giant Connected Component. Preprints 2024, 2024081397. https://doi.org/10.20944/preprints202408.1397.v1 Liu, S.; Pu, T.; Zeng, L.; Wang, Y.; Cheng, H.; Liu, Z. Reinforcement Learning-based Network Dismantling by Targeting Maximum Degree Nodes in the Giant Connected Component. Preprints 2024, 2024081397. https://doi.org/10.20944/preprints202408.1397.v1

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 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 address the network dismantling problem effectively.

Keywords

Complex Networks; Network Dismantling; Graph Representation Learning; Reinforcement Learning

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.