activity
20212023
most citedThe Robustness of Graph k-shell Structure under Adversarial Attacks

9 citations · 14 across the 5 of their papers we have counts for

collaborators

5 papers

cs.SI2023★ 1 cited

MONA: An Efficient and Scalable Strategy for Targeted k-Nodes Collapse

Yuqian Lv, Bo Zhou, Jinhuan Wang +2

The concept of k-core plays an important role in measuring the cohesiveness and engagement of a network. And recent studies have shown the vulnerability of k-core under adversarial…

cs.LG2023★ 1 cited

Single Node Injection Label Specificity Attack on Graph Neural Networks via Reinforcement Learning

Dayuan Chen, Jian Zhang, Yuqian Lv +5

Graph neural networks (GNNs) have achieved remarkable success in various real-world applications. However, recent studies highlight the vulnerability of GNNs to malicious perturbat…

cs.SI2022

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

Yuqian Lv, Bo Zhou, Jinhuan Wang +1

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 engageme…

cs.SI2021★ 3 cited

COREATTACK: Breaking Up the Core Structure of Graphs

Bo Zhou, Yuqian Lv, Jinhuan Wang +2

The concept of k-core in complex networks plays a key role in many applications, e.g., understanding the global structure, or identifying central/critical nodes, of a network. A ma…

cs.SI2021★ 9 cited

The Robustness of Graph k-shell Structure under Adversarial Attacks

B. Zhou, Y. Q. Lv, Y. C. Mao +3

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 bro…