Corpus ID: 236493195

The Robustness of Graph k-shell Structure under Adversarial Attacks

  title={The Robustness of Graph k-shell Structure under Adversarial Attacks},
  author={B. Zhou and Y. Q. Lv and Y. C. Mao and J. H. Wang and S. Q. Yu and Qi Xuan},
  • B. Zhou, Y. Q. Lv, +3 authors Q. Xuan
  • Published 2021
  • Computer Science
  • ArXiv
The k-shell decomposition plays an important role in unveiling the structural properties of a network, i.e., it is widely adopted to find the densest part of a network across a broad range of scientific fields, including Internet, biological networks, social networks etc. However, there arises concern about the robustness of the k-shell structure when networks suffer from adversarial attacks. Here, we introduce and formalize the problem of kshell attack and develop an efficient strategy to… Expand

Figures and Tables from this paper


Adversarial attack on BC classification for scale-free networks.
The results of this paper suggest that to classify a network to be scale-free, one has to be very careful from the viewpoint of adversarial attack effects. Expand
Adversarial Attacks on Neural Networks for Graph Data
This work introduces the first study of adversarial attacks on attributed graphs, specifically focusing on models exploiting ideas of graph convolutions, and generates adversarial perturbations targeting the node's features and the graph structure, taking the dependencies between instances in account. Expand
A k-shell decomposition method for weighted networks
The method takes into account both the weight and the degree of a network, in such a way that in the absence of weights the authors resume the shell structure obtained by the classic k-shell decomposition, and in the presence of weights is able to partition the network in a more refined way. Expand
Optimization of robustness of complex networks
Abstract.Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which… Expand
GA-Based Q-Attack on Community Detection
This work introduces and formalizes the problem of community detection attack and develops efficient strategies to attack community detection algorithms by rewiring a small number of connections, leading to privacy protection. Expand
Target Defense Against Link-Prediction-Based Attacks via Evolutionary Perturbations
The experimental results demonstrate the superiority of the evolutionary perturbations, especially EDA, for defending against RA attack and show that the proposed perturbation generated by EDA is transferable and can even defend against other link prediction attacks which are based on high order similarity between pairwise nodes. Expand
k-core: Theories and applications
This review aims at filling the gap by making a comprehensive review of the theoretical advances on k -core decomposition problem, along with a review of a few applications of the k - core decomposition from many interdisciplinary perspectives. Expand
Thresholds for epidemic spreading in networks
It is conjecture that on quenched scale-rich networks the threshold of generic epidemic models is vanishing or finite depending on the presence or absence of a steady state. Expand
Mitigation of malicious attacks on networks
It is shown that with small changes in the network structure (low cost) the robustness of diverse networks can be improved dramatically whereas their functionality remains unchanged and is useful not only for improving significantly with low cost the robustity of existing infrastructures but also for designing economically robust network systems. Expand
Dynamic Analysis of the Autonomous System Graph
This paper investigates to what extent the information provided by routing tables about the graph of the Autonomous Systems (ASes) can be used to understand dynamic phenomena occurring in the network, and improves cutting-edge technologies used to analyze the structure of the network. Expand