A Generalized Binary Tree Mechanism for Private Approximation of All-Pair Shortest Distances
TL;DR
The problem of approximating all-pair distances in a weighted undirected graph with differential privacy is studied, and efficient algorithms with significantly improved bounds are obtained on a broad class of graphs which are referred to as recursively separable.
Abstract
We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive information, and two graphs are neighbors if their edge weights differ in one edge by at most one. We obtain efficient algorithms with significantly improved bounds on a broad class of graphs which we refer to as recursively separable . In particular, for any n -vertex K h -minor-free graph, our algorithm achieve an additive error of (cid:101) O ( h ( nW ) 1 / 3 ) , where W represents the maximum edge weight; For grid graphs, the same algorithmic scheme achieve additive error of (cid:101) O ( n 1 / 4 √ W ) . Our approach can be seen as a generalization of the celebrated binary tree mechanism for range queries, as releasing range queries is equivalent to computing all-pair distances on a path graph. In essence, our approach is based on generalizing the binary tree mechanism to graphs that are recursively separable .