A deep learning dismantling approach for understanding the structural vulnerability of complex networks

Li Hong, Mengqiao Xu, Yu Liu, Xuemei Zhang and Changjun Fan

Chaos, Solitons & Fractals, 2025, vol. 194, issue C

Abstract: Understanding the structural vulnerability of real-world complex networks is a crucial issue. This issue can be addressed by solving the so-called network dismantling problem, which aims to identify the smallest set of nodes for the fastest dismantling of a network. The network dismantling problem is a computationally challenging task due to its NP-hard nature. The powerful learning capabilities of machine learning methods provide a new perspective for solving this problem. Most existing deep learning methods are based on supervised learning, which rely on pre-labeled training data. These existing methods have achieved promising results in completely dismantling a network. However, they may not perform very well in identifying a very small number of nodes whose removal would significantly degrade—though far from fully dismantle—the network performance. This issue is particularly relevant to many real-world networks like transportation and infrastructure networks. This paper proposes a novel unsupervised learning model called GASC (Graph Attention network integrated with Shortcut Connections mechanism), to address this issue regarding the network dismantling problem. The GASC model employs the graph attention network to learn the underlying features of a network's topological structure and integrates the shortcut connections mechanism to overcome the vanishing gradients problem. Besides, we incorporate a network tailoring method to further improve the performance of our model. We performed comprehensive experiments on both synthetic networks and various real-world networks. The results validate that the proposed approach outperforms existing state-of-the-art methods and demonstrates significant robustness.

Keywords: Complex networks; Structural vulnerability; Network dismantling problem; Graph attention network; Unsupervised learning (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077925001614
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:194:y:2025:i:c:s0960077925001614

DOI: 10.1016/j.chaos.2025.116148

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().