Differentially Private Community Detection for Stochastic Block Models

01/31/2022
by   Mohamed Seif, et al.
0

The goal of community detection over graphs is to recover underlying labels/attributes of users (e.g., political affiliation) given the connectivity between users (represented by adjacency matrix of a graph). There has been significant recent progress on understanding the fundamental limits of community detection when the graph is generated from a stochastic block model (SBM). Specifically, sharp information theoretic limits and efficient algorithms have been obtained for SBMs as a function of p and q, which represent the intra-community and inter-community connection probabilities. In this paper, we study the community detection problem while preserving the privacy of the individual connections (edges) between the vertices. Focusing on the notion of (ϵ, δ)-edge differential privacy (DP), we seek to understand the fundamental tradeoffs between (p, q), DP budget (ϵ, δ), and computational efficiency for exact recovery of the community labels. To this end, we present and analyze the associated information-theoretic tradeoffs for three broad classes of differentially private community recovery mechanisms: a) stability based mechanism; b) sampling based mechanisms; and c) graph perturbation mechanisms. Our main findings are that stability and sampling based mechanisms lead to a superior tradeoff between (p,q) and the privacy budget (ϵ, δ); however this comes at the expense of higher computational complexity. On the other hand, albeit low complexity, graph perturbation mechanisms require the privacy budget ϵ to scale as Ω(log(n)) for exact recovery. To the best of our knowledge, this is the first work to study the impact of privacy constraints on the fundamental limits for community detection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2017

Community detection and stochastic block models: recent developments

The stochastic block model (SBM) is a random graph model with planted cl...
research
02/02/2016

Partial Recovery Bounds for the Sparse Stochastic Block Model

In this paper, we study the information-theoretic limits of community de...
research
05/26/2021

Consistency of Privacy-Preserving Spectral Clustering under the Stochastic Block Model

The stochastic block model (SBM) – a network model featuring community s...
research
08/29/2022

Dynamic Network Sampling for Community Detection

We propose a dynamic network sampling scheme to optimize block recovery ...
research
02/13/2020

Differentially Private Call Auctions and Market Impact

We propose and analyze differentially private (DP) mechanisms for call a...
research
08/31/2019

Publishing Community-Preserving Attributed Social Graphs with a Differential Privacy Guarantee

We present a novel method for publishing differentially private syntheti...
research
11/09/2016

Node Embedding via Word Embedding for Network Community Discovery

Neural node embeddings have recently emerged as a powerful representatio...

Please sign up or login with your details

Forgot password? Click here to reset