.png){kind=icon}
.png){kind=icon}
Return
Spatial network disintegration based on spatial coverage
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ress.2024.110525.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of network disintegration, such as interrupting rumor spreading networks and dismantling terrorist networks, involves evaluating changes in network performance. However, traditional metrics primarily focus on the topological structure and often neglect the crucial spatial attributes of nodes and edges, thereby failing to capture the spatial functional losses. Here we first introduce the concept of spatial coverage to evaluate the spatial network performance, which is defined as the convex hull area of the largest connected component. Then a greedy algorithm is proposed to maximize the reduction of the convex hull area through strategic node removals. Extensive experiments verified that the spatial coverage metric can effectively quantify changes in the performance of spatial networks, and the proposed algorithm can maximize the reduction of the convex hull area of the largest connected component compared to genetic algorithm and centrality strategies. Specifically, our algorithm reduces the convex hull area by up to 30% compared to the best-performing strategy. These results indicate that the critical nodes influencing network performance are a combination of numerous peripheral spatial leaf nodes and a few central spatial core nodes. This study substantially enhances our understanding of spatial network robustness and provides a novel perspective for network optimization.
Keywords:
Spatial network
Network disintegration
Network performance
Spatial coverage
Greedy algorithm
Critical nodes
Journal
R
IF:
11
Papers:
9.0K
Citations:
4.2W