Abstract:Spectral community detection estimates latent labels from the leading eigenspace of a network adjacency matrix, but releasing the resulting labels can disclose sensitive relational information. We consider this problem under differential privacy for both ordinary and bipartite networks. For ordinary networks, the protected unit is a single edge, leading to edge differential privacy (edge-DP). For bipartite networks, the inferential target is the community structure of the left-side nodes, while the protected unit is an entire right-side incidence profile, leading to column-node-DP. We propose NetPTR, a private spectral clustering procedure that releases a noisy empirical spectral embedding after a stability test. The algorithm requires perturbation bounds for empirical eigenspaces under neighboring-network changes, which yield computable stability certificates and local sensitivity bounds. For ordinary networks, we establish edge-DP and the error bound under the degree-corrected stochastic blockmodel, which separates the non-private spectral clustering error from the additional privacy-induced error. It therefore guarantees weak consistency in sparse networks and exact recovery in moderate sparse networks. A matching lower bound shows that the required privacy budget is sharp up to logarithmic factors. We further develop a column-node-DP algorithm for bipartite networks and prove consistency under a bipartite degree-corrected block model. Simulations and real-data examples illustrate the resulting privacy--accuracy tradeoff.
From: Tao Shen [view email]
[v1]
Mon, 22 Jun 2026 07:50:15 UTC (1,721 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。