arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.13460cs.DS
收藏

差分隐私图着色

Differentially Private Graph Coloring

University of Maryland, College Park(马里兰大学帕克分校);Haverford College(哈弗福德学院)

Michael Xie, Jiayi Wu, Dung Nguyen, Aravind Srinivasan

AI总结:

针对边差分隐私的图着色问题,提出两种算法:随机初始着色后通过指数机制局部重采样,实现最小颜色数下的低缺陷着色。

摘要:

差分隐私是隐私保护数据分析的黄金标准。本文解决了计算边差分隐私顶点着色的挑战。我们提出了两种新颖的算法。两种算法都首先从固定大小的调色板中均匀随机地为每个顶点着色,然后应用指数机制对所有顶点或选定的顶点子集进行局部重采样。图的任何非平凡的边差分隐私着色都需要是有缺陷的,因为正常着色会暴露两个同色顶点之间不存在边。如果每个顶点与其最多$k$个邻居共享颜色,则着色是$k$-有缺陷的。我们的目标是设计使用最少颜色数的着色算法,同时在边差分隐私下实现尽可能小的缺陷。我们的第一种算法适用于最大度为$\Delta$的$d$-归纳图。我们证明它使用大小为$\Theta(\frac{\Delta}{\log n}+\frac{1}{\epsilon})$的调色板,产生具有$O(\frac{\log n}{\epsilon}+d)$最大缺陷的\(3\epsilon\)-差分隐私着色。我们的第二种算法利用噪声阈值化,使用大小为$\Theta(\frac{\Delta}{\log n}+\frac{1}{\epsilon})$的调色板,保证$O(\frac{\log n}{\epsilon})$的最大缺陷,将结果推广到所有图而不仅仅是$d$-归纳图。

英文摘要:

Differential Privacy is the gold standard in privacy-preserving data analysis. This paper addresses the challenge of computing an edge-differentially private vertex coloring. In this paper, we present two novel algorithms for this problem. Both algorithms begin by coloring each vertex uniformly at random from a fixed-size palette, and then apply the exponential mechanism to locally resample colors for either all vertices or a selected subset of vertices. Any non-trivial edge differentially private coloring of a graph needs to be defective, as a proper coloring exposes the non-existence of an edge between two vertices of the same color. A coloring is $k$-defective if each vertex shares its color with at most $k$ of its neighbors. Our goal is to design coloring algorithms that use the minimum number of colors, while achieving the smallest possible defect under the edge-differential privacy. Our first algorithm applies to $d$-inductive graphs with maximum degree $Δ$. We show that it yields a \(3ε\)-differentially private coloring with \(O(\frac{\log n}ε+d)\) maximum defect, using a palette of size $Θ(\fracΔ{\log n}+\frac{1}ε)$. Our second algorithm utilizes noisy thresholding to guarantee \(O(\frac{\log n}ε)\) maximum defect, using a palette of size $Θ(\fracΔ{\log n}+\frac{1}ε)$, generalizing the results to all graphs rather than just $d$-inductive ones.

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

↑