Robustness for Spectral Clustering of General Graphs under Local Differential Privacy. (arXiv:2309.06867v1 [cs.CR])

Spectral clustering is a widely used algorithm to find clusters in networks.
Several researchers have studied the stability of spectral clustering under
local differential privacy with the additional assumption that the underlying
networks are generated from the stochastic block model (SBM). However, we argue
that this assumption is too restrictive since social networks do not originate
from the SBM. Thus, delve into an analysis for general graphs in this work. Our
primary focus is the edge flipping method -- a …

algorithm block clustering clusters differential privacy find general generated graphs local networks privacy researchers robustness spectral stability under