Differentially Private Community Detection in $h$-uniform Hypergraphs
Javad Zahedi Moghaddam, Aria Nosratinia

TL;DR
This paper investigates the thresholds for exact community detection in $h$-uniform hypergraphs under differential privacy constraints, analyzing how privacy budgets affect the ability to recover community structure.
Contribution
It introduces and compares three differentially private mechanisms for hypergraph community detection, providing exact recovery thresholds and analyzing privacy-utility trade-offs.
Findings
Sampling-based and randomized response mechanisms achieve pure $\e$-hyperedge DP.
Stability-based mechanisms cannot achieve pure $\e$-DP.
Privacy budget scales logarithmically with hyperedge density ratio or depends on hypergraph size.
Abstract
This paper studies the exact recovery threshold subject to preserving the privacy of connections in -uniform hypergraphs. Privacy is characterized by the -hyperedge differential privacy (DP), an extension of the notion of -edge DP in the literature. The hypergraph observations are modeled through a -uniform stochastic block model (-HSBM) in the dense regime. We investigate three differentially private mechanisms: stability-based, sampling-based, and perturbation-based mechanisms. We calculate the exact recovery threshold for each mechanism and study the contraction of the exact recovery region due to the privacy budget, . Sampling-based mechanisms and randomized response mechanisms guarantee pure -hyperedge DP where , while the stability-based mechanisms cannot achieve this level of privacy. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
