Community Concealment from Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNNs) enable powerful unsupervised learning of communities. However, such inference may inadvertently expose sensitive group structures, critical clustered patterns, or collective behaviors, raising concerns about sensitive group-level privacy. In social and critical infrastructure networks, unauthorized community inference can reveal coordinated asset groups, operational hierarchies, and system dependencies that may be exploited for reconnaissance or profiling. We study a defensive setting in which a network (or defender) operator seeks to conceal a community of interest while making only small, utility-preserving modifications to the network. Our analysis shows that community concealment depends on two measurable factors: the connectivity at the community boundary and the feature similarity between the protected community and its neighbors. Guided by these observations, we introduce Feature-Community-guided DICE (FCom-DICE), a perturbation strategy built on DICE (Disconnect Internally Connect Externally) that rewires a set of structurally influential edges and adjusts node features to reduce the distinctiveness exploited by GNN message passing. Across synthetic benchmarks and real network graphs such as Facebook, Wikipedia, and Bitcoin Transactions, FCom-DICE consistently outperforms structure-only DICE under the same perturbation budgets. The largest improvements are observed for communities that are weakly connected to the rest of the network and well separated in feature space. These gains are achieved while preserving key structural and feature characteristics of the original network. These results demonstrate the effectiveness of feature-aware perturbations for reducing the recoverability of targeted communities under GNN-based community inference.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 79 references that are in the map. First posted on arXiv 12 Feb 2026.
Builds on
37 of 79 references.
References · 37
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2016Variational Graph Auto-Encoderscited by 1,382
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
- 2017Self-Normalizing Neural Networkscited by 598
- 2018Adversarial Attacks on Neural Networks for Graph Datacited by 397
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2019Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensicscited by 164
25 more
- 2020Graph Clustering with Graph Neural Networkscited by 163
- 2020Graph Backdoorcited by 112
- 2019Towards Explainable Artificial Intelligencecited by 106
- 2019Unsupervised Attributed Multiplex Network Embeddingcited by 95
- 2016Hiding Individuals and Communities in a Social Networkcited by 77
- 2018Fast Gradient Attack on Network Embeddingcited by 65
- 2021LinkTeller: Recovering Private Edges from Graph Neural Networks via Influence Analysiscited by 65
- 2014Understanding Random Forests: From Theory to Practicecited by 57
- 2020Uncovering Coordinated Networks on Social Media: Methods and Case Studiescited by 49
- 2016The ground truth about metadata and community detection in networkscited by 42
- 2016A Comparative Analysis of Community Detection Algorithms on Artificial Networkscited by 23
- 2020PANE: scalable and effective attributed network embeddingcited by 23
- 2020Adversarial Attack on Community Detection by Hiding Individualscited by 20
- 2017Element-centric clustering comparison unifies overlaps and hierarchycited by 17
- 2022Synthetic Graph Generation to Benchmark Graph Learningcited by 16
- 2014Community detection in networks: Structural communities versus ground truthcited by 14
- 2018GA Based Q-Attack on Community Detectioncited by 13
- 2019Multiscale Evolutionary Perturbation Attack on Community Detectioncited by 5
- 2024Robustness of shallow graph embedding methods for community detectioncited by 3
- 2015Two samples test for discrete power-law distributionscited by 2
- 2016From Community Detection to Community Deceptioncited by 2
- 2017Compressing networks with super nodescited by 2
- 2021Hide and Seek: Outwitting Community Detection Algorithmscited by 2
- 2024Attacks on Node Attributes in Graph Neural Networkscited by 2
- 2025Community detection robustness of graph neural networkscited by 1
Built on by
Not cited yet.