التفاصيل البيبلوغرافية
| العنوان: |
Reinforcement Learning-Based Network Dismantling by Targeting Maximum-Degree Nodes in the Giant Connected Component. |
| المؤلفون: |
Liu, Shixuan, Pu, Tianle, Zeng, Li, Wang, Yunfei, Cheng, Haoxiang, Liu, Zhong |
| المصدر: |
Mathematics (2227-7390); Sep2024, Vol. 12 Issue 17, p2766, 15p |
| مصطلحات موضوعية: |
REINFORCEMENT learning, REPRESENTATIONS of graphs |
| مستخلص: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Mathematics (2227-7390) is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder