https://doi.org/10.1140/epjds/s13688-026-00645-2
Research
Cross-scale overlapping community hiding via constrained graph adversarial training
1
College of Cyberspace Security, PLA Information Engineer University, 450001, Zhengzhou, Henan, China
2
State Key Laboratory of Mathematical Engineering and Advanced Computing, 450001, Zhengzhou, Henan, China
3
College of Computer and Information Engineering, Henan Normal University, 453001, Xinxiang, Henan, China
4
School of Cyber Science and Engineering, Xi’an Jiaotong University, 710049, Xi’an, Shanxi, China
a
This email address is being protected from spambots. You need JavaScript enabled to view it.
b
This email address is being protected from spambots. You need JavaScript enabled to view it.
Received:
25
September
2025
Accepted:
16
March
2026
Published online:
31
March
2026
Abstract
Community detection algorithms have become essential tools for accurately modeling real-world networks. In particular, the emergence of overlapping community detection techniques has made it possible to identify users’ multiple affiliations, significantly enhancing the analysis of interpersonal relationships. However, this also raises serious privacy concerns, as some users or groups may not wish for their social relationships to be exposed via algorithmic inference. Although several community hiding methods have been proposed to address these issues, existing approaches typically overlook the inherently overlapping characteristics of communities, lack cross-scale adaptability, and exhibit limited interpretability. In this study, we propose a novel overlapping community hiding framework based on constrained graph adversarial training. By integrating trainable layers and a masking mechanism into the adversarial training process, our method effectively achieves multi-scale hiding of overlapping communities, while substantially improving the interpretability of the hiding process. To further enhance the effectiveness of the hiding process, we introduce a novel constraint strategy, termed SAG-NE, into graph adversarial training, which explicitly constrains node representations and symmetric approximate gradients within the same community, thereby increasing node dispersion in both feature and gradient spaces and making it significantly more difficult for existing detection algorithms to uncover the true community structures. Experimental results on multiple real-world and synthetic datasets demonstrate that the proposed framework exhibits robust privacy-preserving performance across different scales.
Key words: Community hiding / Community detection / Privacy protection / Social network / Complex network
Handling Editor: Francesco Gullo
© The Author(s) 2026
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
