arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2504.03354cs.DS
收藏

用于差分隐私近似所有点对距离的广义二叉树机制

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances

Michael Dinitz, Chenglin Fan, Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou

AI总结:

研究差分隐私下加权无向图所有点对距离近似问题,提出广义二叉树机制,在递归可分图(如$K_h$-minor-free图和网格图)上实现显著改进的加性误差界限。

摘要:

我们研究由Sealfon [Sea16]提出的在差分隐私下近似加权无向图中所有点对距离的问题。给定一个公开已知的无向图,我们将边权重视为敏感信息,如果两个图的边权重在一条边上相差不超过1,则它们是相邻的。我们针对一类广泛的图(我们称之为“递归可分”图)获得了具有显著改进误差界限的高效算法。具体而言,对于任意$n$个顶点的$K_h$-minor-free图,我们的算法实现了$\widetilde{O}(h(nW)^{1/3} )$的加性误差,其中$W$表示最大边权重;对于网格图,相同的算法方案实现了$\widetilde{O}(n^{1/4}\sqrt{W})$的加性误差。我们的方法可以看作是著名的用于范围查询的二叉树机制的推广,因为发布范围查询等价于计算路径图上的所有点对距离。本质上,我们的方法是将二叉树机制推广到“递归可分”的图上。

英文摘要:

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 \textit{recursively separable}. In particular, for any $n$-vertex $K_h$-minor-free graph, our algorithm achieve an additive error of $\widetilde{O}(h(nW)^{1/3} ) $, where $ W $ represents the maximum edge weight; For grid graphs, the same algorithmic scheme achieve additive error of $\widetilde{O}(n^{1/4}\sqrt{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 \textit{recursively separable}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑