Volume 143, Number 3, August 2023
|Number of page(s)||7|
|Section||Statistical physics and networks|
|Published online||28 July 2023|
Dismantling networks abruptly by tree decomposition
1 SDU-ANU Joint Science College, Shandong University - Weihai 264209, China
2 School of Mathematics and Statistics, Shandong University - Weihai 264209, China
(a) E-mail: email@example.com (corresponding author)
Received: 29 March 2023
Accepted: 20 July 2023
Dismantling a network by removing the minimum vertices is a challenging problem in complex networks. While most existing methods focus on efficiency, they overlook the importance of abruptness during the dismantling process. Gradual changes in the largest connected component size can alert the target and render the attack ineffective. To overcome this issue, we propose a new dismantling method based on tree decomposition and a new metric quantifying the abruptness of the dismantling process. Our method involves applying tree decomposition to the network using the min fill-in method, identifying the most critical edge in the decomposed tree, and removing the vertices contained in the edge. Experimental results on eight real networks demonstrate that our proposed method significantly outperforms classical methods in abruptness and efficiency.
© 2023 EPLA
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.