arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.05776cs.DScs.CR
收藏

次线性时间内图参数的私人估计

Privately Estimating Graph Parameters in Sublinear time

Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee

摘要:

我们发起了一个系统的研究算法,这两个不同的私人和运行在次线性时间的几个问题,其目标是估计自然图参数。我们的主要结果是一个不同的私人$(1+ρ)$近似算法的问题计算的平均度的一个图,每$ρ>0$。该算法的运行时间与Goldreich和Ron(Sublinear Algorithms,2005)提出的非私有版本大致相同。我们还得到了图的最大匹配尺寸和最小顶点覆盖尺寸的第一微分私有次线性时间近似算法。我们采用的一个总体技术是耦合的随机算法的全局灵敏度的概念。这一敏感性概念的相关变体已在文献中以特别方式使用。在这里,我们正式的概念,并开发它作为一个统一的框架,隐私分析的随机近似算法。

英文摘要:

We initiate a systematic study of algorithms that are both differentially private and run in sublinear time for several problems in which the goal is to estimate natural graph parameters. Our main result is a differentially-private $(1+ρ)$-approximation algorithm for the problem of computing the average degree of a graph, for every $ρ>0$. The running time of the algorithm is roughly the same as its non-private version proposed by Goldreich and Ron (Sublinear Algorithms, 2005). We also obtain the first differentially-private sublinear-time approximation algorithms for the maximum matching size and the minimum vertex cover size of a graph. An overarching technique we employ is the notion of coupled global sensitivity of randomized algorithms. Related variants of this notion of sensitivity have been used in the literature in ad-hoc ways. Here we formalize the notion and develop it as a unifying framework for privacy analysis of randomized approximation algorithms.

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

↑