Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph

arXiv:2402.18020v1 Announce Type: cross
Abstract: Computing the core decomposition of a graph is a fundamental problem that has recently been studied in the differentially private setting, motivated by practical applications in data mining. In particular, Dhulipala et al. [FOCS 2022] gave the first mechanism for approximate core decomposition in the challenging and practically relevant setting of local differential privacy. One of the main open problems left by their work is whether the accuracy, i.e., the approximation ratio and additive error, …

applications arxiv computing cs.cr cs.ds data data mining graph local mechanism mining private problem