Consistent Spectral Clustering of Network Block Models under Local Differential Privacy
arXiv:2105.12615 · doi:10.29012/jpc.811
Abstract
The stochastic block model (SBM) and degree-corrected block model (DCBM) are network models often selected as the fundamental setting in which to analyze the theoretical properties of community detection methods. We consider the problem of spectral clustering of SBM and DCBM networks under a local form of edge differential privacy. Using a randomized response privacy mechanism called the edge-flip mechanism, we develop theoretical guarantees for differentially private community detection, demonstrating conditions under which this strong privacy guarantee can be upheld while achieving spectral clustering convergence rates that match the known rates without privacy. We prove the strongest theoretical results are achievable for dense networks (those with node degree linear in the number of nodes), while weak consistency is achievable under mild sparsity (node degree greater than ). We empirically demonstrate our results on a number of network examples.
arXiv comment32 pages, 7 figures
References in corpus (8)
- Stochastic blockmodels and community structure in networks
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Social Structure of Facebook Networks
- Fast community detection by SCORE
- Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
- Covariate-assisted spectral clustering
- Statistical inference on random dot product graphs: a survey
- Locally Differentially Private Analysis of Graph Statistics