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

随机块模型的差分隐私精确恢复

Differentially private exact recovery for stochastic block models

University of Virginia(弗吉尼亚大学);Biocomplexity Institute and Initiative(生物复杂性研究所与倡议项目);Department of Computer Science(计算机科学系)

Dung Nguyen, Anil Vullikanti

AI总结:

研究私有网络下随机块模型的可恢复性问题,在边差分隐私下为三种SBM变体推导了精确恢复条件,其多项式时间算法在隐私松弛时匹配非私有的恢复阈值。

摘要:

随机块模型(SBMs)是社区检测算法中非常普遍研究的网络模型。在SBM的标准形式中,图的$n$个顶点(或节点)通常被划分为多个预先确定的社区(或簇)。顶点对之间的连接是随机且独立地以预定义概率生成的,该概率取决于包含这两个节点的社区。SBM中的一个基本问题是社区结构的恢复,并且对于许多版本的SBM,其可恢复性的信息论紧致界已知。我们在此关注的是网络为私有情况下的SBM可恢复性问题。在边差分隐私模型下,我们推导了三种不同版本SBM的精确可恢复性条件,即非对称SBM(当社区大小不均匀时)、一般结构SBM(带异常值)和审查SBM(带边特征)。我们的私有算法相对于输入图的大小具有多项式运行时间,并且在$ε\rightarrow\infty$时与非私有设置下的恢复阈值相匹配。相比之下,先前关于SBM可恢复性的最佳结果仅适用于对称情况(社区大小相等),且在准多项式时间内运行,或者在多项式时间内运行但恢复阈值与非私有设置相比仅在常数范围内紧致。

英文摘要:

Stochastic block models (SBMs) are a very commonly studied network model for community detection algorithms. In the standard form of an SBM, the $n$ vertices (or nodes) of a graph are generally divided into multiple pre-determined communities (or clusters). Connections between pairs of vertices are generated randomly and independently with pre-defined probabilities, which depend on the communities containing the two nodes. A fundamental problem in SBMs is the recovery of the community structure, and sharp information-theoretic bounds are known for recoverability for many versions of SBMs. Our focus here is the recoverability problem in SBMs when the network is private. Under the edge differential privacy model, we derive conditions for exact recoverability in three different versions of SBMs, namely Asymmetric SBM (when communities have non-uniform sizes), General Structure SBM (with outliers), and Censored SBM (with edge features). Our private algorithms have polynomial running time w.r.t. the input graph's size, and match the recovery thresholds of the non-private setting when $ε\rightarrow\infty$. In contrast, the previous best results for recoverability in SBMs only hold for the symmetric case (equal size communities), and run in quasi-polynomial time, or in polynomial time with recovery thresholds being tight up to some constants from the non-private settings.

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

↑