English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper explores the effectiveness of network attack when the attacker hasimperfect information about the network. For Erd\H{o}s-R\'enyi networks, weobserve that dynamical importance and betweenness centrality-based attacks aresurprisingly robust to the presence of a moderate amount of imperfectinformation and are more effective compared with simpler degree-based attackseven at moderate levels of network information error. In contrast, forscale-free networks the effectiveness of attack is much less degraded by amoderate level of information error. Furthermore, in the Erd\H{o}os-R\'enyicase the effectiveness of network attack is much more degraded by missing linksas compared with the same number of false links.

The Impact of Imperfect Information on Network Attack