kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Enhancing core–periphery robustness of networks against link-based attacks with imprecise information
o=School of Automation, Wuhan University of Technology, c=Wuhan,cp=, p=430070, cy=China.
o=School of Automation, Wuhan University of Technology, c=Wuhan,cp=, p=430070, cy=China.
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.ORCID iD: 0000-0003-0177-1993
o=School of Automation, Wuhan University of Technology, c=Wuhan,cp=, p=430070, cy=China.
Show others and affiliations
2024 (English)In: Chaos, Solitons & Fractals, ISSN 0960-0779, E-ISSN 1873-2887, Vol. 183, article id 114932Article in journal (Refereed) Published
Abstract [en]

Core-Periphery structure, as a critical mesoscale structure, is commonly found in diverse real-world networks, in which nodes are endogenously categorized as core or peripheral nodes by the underlying interconnection patterns. It plays an important role in sustaining the intrinsic order and functional behavior of networked systems. However, despite the study on inherent core–periphery vulnerabilities to node removals, little is known on the core–periphery robustness when networks are suffering from the attacks that happen on links between nodes, especially for the more practical situations where attackers have limited ability to obtain precise network information. In this paper, a novel index is proposed for measuring the capacity of the core–periphery structure to resist link-based attacks. By introducing an attack precision parameter, we establish a unified evaluation framework for link-based attacks with imprecise information, which divides attack behaviors into localized attacks and non-localized attacks, and treats the usual random attacks and targeted attacks as the two special situations of our non-localized case. Several enhancing algorithms guided by our index with local search strategy are exquisitely devised, and experimental results are provided to demonstrate the efficacy of our framework and algorithms that remarkably improve the core–periphery robustness against link-based attacks with imprecise information.

Place, publisher, year, edition, pages
Elsevier Ltd , 2024. Vol. 183, article id 114932
Keywords [en]
Core-periphery structure, Imprecise information, Networks, Robustness
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-346507DOI: 10.1016/j.chaos.2024.114932Scopus ID: 2-s2.0-85192175960OAI: oai:DiVA.org:kth-346507DiVA, id: diva2:1858423
Note

QC 20240520

Available from: 2024-05-16 Created: 2024-05-16 Last updated: 2024-05-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Hu, Xiaoming

Search in DiVA

By author/editor
Hu, Xiaoming
By organisation
Optimization and Systems Theory
In the same journal
Chaos, Solitons & Fractals
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 69 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf