Edge-level differential privacy protects only tests between complete neighboring networks, not tests of individual edges, except under independence or bounded-dependence conditions.
Publishing Community-Preserving Attributed Social Graphs with a Differential Privacy Guarantee
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We present a novel method for publishing differentially private synthetic attributed graphs. Unlike preceding approaches, our method is able to preserve the community structure of the original graph without sacrificing the ability to capture global structural properties. Our proposal relies on C-AGM, a new community-preserving generative model for attributed graphs. We equip C-AGM with efficient methods for attributed graph sampling and parameter estimation. For the latter, we introduce differentially private computation methods, which allow us to release community-preserving synthetic attributed social graphs with a strong formal privacy guarantee. Through comprehensive experiments, we show that our new model outperforms its most relevant counterparts in synthesising differentially private attributed social graphs that preserve the community structure of the original graph, as well as degree sequences and clustering coefficients.
fields
math.ST 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Interpreting Network Differential Privacy
Edge-level differential privacy protects only tests between complete neighboring networks, not tests of individual edges, except under independence or bounded-dependence conditions.