Optimal Cost-Based Strengthening of Complex Networks

Most real-world complex systems are extremely vulnerable to targeted attacks, making their immunization an important yet challenging task. One of the most effective attack strategies is targeting articulation points specifically. In this study, we first propose a generalized definition of network ro...

Descripción completa

Detalles Bibliográficos
Autores: Rong, Qingnan, Zhang, Jun, Sun, Xiaoqian, Wandelt, Sebastian, Zanin, Massimiliano, Tian, Liang
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2022
País:España
Institución:Consejo Superior de Investigaciones Científicas (CSIC)
Repositorio:DIGITAL.CSIC. Repositorio Institucional del CSIC
OAI Identifier:oai:digital.csic.es:10261/271151
Acceso en línea:http://hdl.handle.net/10261/271151
Access Level:acceso abierto
Palabra clave:Network robustness
Targeted attacks
Cost
Strengthening problem
Heuristic
id ES_b2b8e19abf319c190562d2e904f6d445
oai_identifier_str oai:digital.csic.es:10261/271151
network_acronym_str ES
network_name_str España
repository_id_str
spelling Optimal Cost-Based Strengthening of Complex NetworksRong, QingnanZhang, JunSun, XiaoqianWandelt, SebastianZanin, MassimilianoTian, LiangNetwork robustnessTargeted attacksCostStrengthening problemHeuristicMost real-world complex systems are extremely vulnerable to targeted attacks, making their immunization an important yet challenging task. One of the most effective attack strategies is targeting articulation points specifically. In this study, we first propose a generalized definition of network robustness. Then we address the problem of strengthening network robustness with the minimum cost by exploiting the intuition behind the attack strategy based on articulation points, that is proven to be NP-hard. Accordingly, we propose a heuristic for solving this problem, subject to a cost function whose choice determines the obtained network regime. Experiments on both random and real-world networks show that our algorithm strengthens the robustness by using significantly cheaper edge additions than state-of-the-art methods. Moreover, our algorithm excels against general attack strategies by revealing the essence of strengthening network robustness, that is, increasing the size of the giant connected component optimally in the process of node removal. While considering the realistic problem, our algorithm also provides a reasonable scheme to add edges at a low cost.Peer reviewedInstitute of Electrical and Electronics EngineersConsejo Superior de Investigaciones Científicas [https://ror.org/02gfc7t72]202220222022info:eu-repo/semantics/articlehttp://purl.org/coar/resource_type/c_6501Postprintinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttp://hdl.handle.net/10261/271151reponame:DIGITAL.CSIC. Repositorio Institucional del CSICinstname:Consejo Superior de Investigaciones Científicas (CSIC)Ingléshttps://doi.org/10.1109/TNSE.2021.3132703Síinfo:eu-repo/semantics/openAccessoai:digital.csic.es:10261/2711512026-05-22T06:33:51Z
dc.title.none.fl_str_mv Optimal Cost-Based Strengthening of Complex Networks
title Optimal Cost-Based Strengthening of Complex Networks
spellingShingle Optimal Cost-Based Strengthening of Complex Networks
Rong, Qingnan
Network robustness
Targeted attacks
Cost
Strengthening problem
Heuristic
title_short Optimal Cost-Based Strengthening of Complex Networks
title_full Optimal Cost-Based Strengthening of Complex Networks
title_fullStr Optimal Cost-Based Strengthening of Complex Networks
title_full_unstemmed Optimal Cost-Based Strengthening of Complex Networks
title_sort Optimal Cost-Based Strengthening of Complex Networks
dc.creator.none.fl_str_mv Rong, Qingnan
Zhang, Jun
Sun, Xiaoqian
Wandelt, Sebastian
Zanin, Massimiliano
Tian, Liang
author Rong, Qingnan
author_facet Rong, Qingnan
Zhang, Jun
Sun, Xiaoqian
Wandelt, Sebastian
Zanin, Massimiliano
Tian, Liang
author_role author
author2 Zhang, Jun
Sun, Xiaoqian
Wandelt, Sebastian
Zanin, Massimiliano
Tian, Liang
author2_role author
author
author
author
author
dc.contributor.none.fl_str_mv Consejo Superior de Investigaciones Científicas [https://ror.org/02gfc7t72]
dc.subject.none.fl_str_mv Network robustness
Targeted attacks
Cost
Strengthening problem
Heuristic
topic Network robustness
Targeted attacks
Cost
Strengthening problem
Heuristic
description Most real-world complex systems are extremely vulnerable to targeted attacks, making their immunization an important yet challenging task. One of the most effective attack strategies is targeting articulation points specifically. In this study, we first propose a generalized definition of network robustness. Then we address the problem of strengthening network robustness with the minimum cost by exploiting the intuition behind the attack strategy based on articulation points, that is proven to be NP-hard. Accordingly, we propose a heuristic for solving this problem, subject to a cost function whose choice determines the obtained network regime. Experiments on both random and real-world networks show that our algorithm strengthens the robustness by using significantly cheaper edge additions than state-of-the-art methods. Moreover, our algorithm excels against general attack strategies by revealing the essence of strengthening network robustness, that is, increasing the size of the giant connected component optimally in the process of node removal. While considering the realistic problem, our algorithm also provides a reasonable scheme to add edges at a low cost.
publishDate 2022
dc.date.none.fl_str_mv 2022
2022
2022
dc.type.none.fl_str_mv info:eu-repo/semantics/article
http://purl.org/coar/resource_type/c_6501
Postprint
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10261/271151
url http://hdl.handle.net/10261/271151
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv https://doi.org/10.1109/TNSE.2021.3132703
Sí
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers
dc.source.none.fl_str_mv reponame:DIGITAL.CSIC. Repositorio Institucional del CSIC
instname:Consejo Superior de Investigaciones Científicas (CSIC)
instname_str Consejo Superior de Investigaciones Científicas (CSIC)
reponame_str DIGITAL.CSIC. Repositorio Institucional del CSIC
collection DIGITAL.CSIC. Repositorio Institucional del CSIC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417078786621440
score 15,812455

Similares en LA Referencia