Targeted k-node Collapse Problem: Towards Understanding the Robustness of Local k-core Structure

12/31/2022
by   Yuqian Lv, et al.
0

The concept of k-core, which indicates the largest induced subgraph where each node has k or more neighbors, plays a significant role in measuring the cohesiveness and the engagement of a network, and it is exploited in diverse applications, e.g., network analysis, anomaly detection, community detection, etc. Recent works have demonstrated the vulnerability of k-core under malicious perturbations which focuses on removing the minimal number of edges to make a whole k-core structure collapse. However, to the best of our knowledge, there is no existing research concentrating on how many edges should be removed at least to make an arbitrary node in k-core collapse. Therefore, in this paper, we make the first attempt to study the Targeted k-node Collapse Problem (TNCP) with four novel contributions. Firstly, we offer the general definition of TNCP problem with the proof of its NP-hardness. Secondly, in order to address the TNCP problem, we propose a heuristic algorithm named TNC and its improved version named ATNC for implementations on large-scale networks. After that, the experiments on 16 real-world networks across various domains verify the superiority of our proposed algorithms over 4 baseline methods along with detailed comparisons and analyses. Finally, the significance of TNCP problem for precisely evaluating the resilience of k-core structures in networks is validated.

READ FULL TEXT
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
06/21/2023

Quantifying Node-based Core Resilience

Core decomposition is an efficient building block for various graph anal...
research
06/27/2019

K-Core Maximization through Edge Additions

A popular model to measure the stability of a network is k-core - the ma...
research
08/17/2022

AHEAD: A Triple Attention Based Heterogeneous Graph Anomaly Detection Approach

Graph anomaly detection on attributed networks has become a prevalent re...
research
02/22/2021

Hide and Seek: Outwitting Community Detection Algorithms

Community affiliation of a node plays an important role in determining i...
research
01/08/2019

K-Core Minimization: A Game Theoretic Approach

K-cores are maximal induced subgraphs where all vertices have degree at ...
research
01/16/2021

Informative core identification in complex networks

In network analysis, the core structure of modeling interest is usually ...

Please sign up or login with your details

Forgot password? Click here to reset