Back to Search
Start Over
Reinforcement Learning-Based Network Dismantling by Targeting Maximum-Degree Nodes in the Giant Connected Component
- Source :
- Mathematics, Vol 12, Iss 17, p 2766 (2024)
- Publication Year :
- 2024
- Publisher :
- MDPI AG, 2024.
-
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.
Details
- Language :
- English
- ISSN :
- 12172766 and 22277390
- Volume :
- 12
- Issue :
- 17
- Database :
- Directory of Open Access Journals
- Journal :
- Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.97c9e0c4b7204781927df5371c8f7af5
- Document Type :
- article
- Full Text :
- https://doi.org/10.3390/math12172766