English
 
Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Cost-Effective Network Disintegration Through Targeted Enumeration

Authors
/persons/resource/zhigang.wang

Wang,  Zhigang
Potsdam Institute for Climate Impact Research;

Deng,  Ye
External Organizations;

Holme,  Petter
External Organizations;

Di,  Zengru
External Organizations;

Lü,  Linyuan
External Organizations;

Wu,  Jun
External Organizations;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PIKpublic
Supplementary Material (public)
There is no public supplementary material available
Citation

Wang, Z., Deng, Y., Holme, P., Di, Z., Lü, L., Wu, J. (2024): Cost-Effective Network Disintegration Through Targeted Enumeration. - IEEE Transactions on Systems, Man, and Cybernetics: Systems, 54, 12, 7657-7669.
https://doi.org/10.1109/TSMC.2024.3454780


Cite as: https://publications.pik-potsdam.de/pubman/item/item_31349
Abstract
Finding an optimal subset of nodes or links to disintegrate harmful networks is a fundamental problem in network science, with potential applications to anti-terrorism, epidemic control, and many other fields of study. The challenge of the network disintegration problem is to balance the effectiveness and efficiency of strategies. In this article, we propose a cost-effective targeted enumeration (TE) method for network disintegration. The proposed approach includes two stages: 1) searching for candidate objects and 2) identifying an optimal solution. In the first stage, we use rank aggregation to generate a comprehensive ranking of node importance, upon which we identify a small-scale candidate set of nodes to remove. In the second stage, we use an enumeration method to find an optimal combination among the candidate nodes. Extensive experimental results on synthetic and real-world networks demonstrate that the proposed method achieves a satisfying tradeoff between effectiveness and efficiency. Our adaptable TE approach can effectively address a range of combinatorial optimization challenges with significant potential applications, including personnel recruitment, portfolio management, and pharmaceutical development.