Differentially Private Online Community Detection for Censored Block Models: Algorithms and Fundamental Limits

We study the private online change detection problem for dynamic communities, using a censored block model (CBM). We consider edge differential privacy (DP) in both local and central settings, and propose joint change detection and community estimation procedures for both scenarios. We seek to understand the fundamental tradeoffs between the privacy budget, detection delay, and exact community recovery of community labels. Further, we provide theoretical guarantees for the effectiveness of our proposed method by showing necessary and sufficient conditions for change detection and exact recovery under edge DP. Simulation and real data examples are provided to validate the proposed methods.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Forensics and Security
Published
2025-01-01
DOI
https://doi.org/10.1109/tifs.2025.3592556
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Differentially Private Online Community Detection for Censored Block Models: Algorithms and Fundamental Limits

Mohamed Seif, H. Vincent Poor, Andrea Goldsmith, Liyan Xie
1 citations
IEEE Transactions on Information Forensics and Security
Privacy-Preserving Technologies in Data
2.48
article

Differentially Private Online Community Detection for Censored Block Models: Algorithms and Fundamental Limits

Mohamed Seif, H. Vincent Poor, Andrea Goldsmith, Liyan Xie
article en
1 citations

Abstract

We study the private online change detection problem for dynamic communities, using a censored block model (CBM). We consider edge differential privacy (DP) in both local and central settings, and propose joint change detection and community estimation procedures for both scenarios. We seek to understand the fundamental tradeoffs between the privacy budget, detection delay, and exact community recovery of community labels. Further, we provide theoretical guarantees for the effectiveness of our proposed method by showing necessary and sufficient conditions for change detection and exact recovery under edge DP. Simulation and real data examples are provided to validate the proposed methods.

IEEE Transactions on Information Forensics and SecurityVol. 20
University of Minnesota (US), Princeton University (US), Twin Cities Orthopedics (US)
National Science Foundation, Air Force Office of Scientific Research
Reduced inequalities
Openalex Percentile: Top 9%
Privacy-Preserving Technologies in Data
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.