Robustness of Complex Networks Considering Load and Cascading Failure under Edge-removal Attack

03/28/2023
by   Peng Geng, et al.
0

In the understanding of important edges in complex networks, the edges with larger degree are naturally considered more important, and they will cause greater destructiveness when attacked. However, through simulation analysis, we conclude that this understanding needs to be based on certain preconditions. In this article, the robustness of BA scale-free network and WS small-world network is studied based on the edge-removal attack strategy considering the edge load and cascading failure. Specific attack methods include: High Load Edge-removal Attacks (HLEA) and Low Load Edge-removal Attacks (LLEA). The simulation results show that the importance of edges is closely related to the load parameter δ. When 0<δ<1, attacking the edge with smaller degree will cause greater cascading failure. For this condition, the edge with smaller degree is more important. When δ=1, cascading failure is basically independent of the edge degree. When δ>1, attacking the edge with larger degree will cause greater cascading failure. Therefore, the edge with larger degree is more important for this condition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2022

Optimizing Vehicle-to-Edge Mapping with Load Balancing for Attack-Resilience in IoV

Attack-resilience is essential to maintain continuous service availabili...
research
08/09/2019

Kernel for Kt-free edge deletion

In the K_t-free edge deletion problem, the input is a graph G and an int...
research
11/30/2021

COREATTACK: Breaking Up the Core Structure of Graphs

The concept of k-core in complex networks plays a key role in many appli...
research
07/02/2019

A Local Perspective on the Edge Removal Problem

The edge removal problem studies the loss in network coding rates that r...
research
06/24/2020

Network connectivity under a probabilistic node failure model

Centrality metrics have been widely applied to identify the nodes in a g...
research
03/27/2019

Scaling up the randomized gradient-free adversarial attack reveals overestimation of robustness using established attacks

Modern neural networks are highly non-robust against adversarial manipul...
research
10/07/2017

Combinatorial Miller-Hagberg Algorithm for Randomization of Dense Networks

We propose a slightly revised Miller-Hagberg (MH) algorithm that efficie...

Please sign up or login with your details

Forgot password? Click here to reset