arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.06832math.STstat.TH
收藏

在几乎完全标记的图匹配中实现精确恢复

Exact recovery for seeded graph matching

Nicolas Fraiman, Michael Nisenzon

AI总结:

在几乎完全标记的图匹配中,通过多项式时间算法实现精确恢复,首次提出统计与计算层面的精确阈值条件。

摘要:

我们研究了在几乎完全标记的条件下,两个相关网络之间的图匹配问题,其中几乎所有的顶点对应关系都被揭示。具体来说,我们考虑相关随机块模型,并假设对于某些α∈(0,1),n^{1−α}个顶点未被揭示,而其余n−n^{1−α}个顶点作为种子对应关系提供。我们的目标是确定当未被揭示顶点的比例消失时,能否高效地恢复真实的排列。我们证明,当λs² > 1−α时,可以在多项式时间内精确恢复剩余的对应关系,其中λ=(a+b)/2是SBM密度参数,s表示边保留参数。该条件在完全标记设置和经典无标记阈值λs² > 1之间平滑过渡。我们的分析适用于简单的邻域重叠规则和双随机松弛后投影,从而在几乎完全标记的条件下建立了匹配的可行性,而无需使用谱方法或信息传递。另一方面,我们证明在该阈值以下,精确恢复在高概率下是信息论上不可能的。因此,我们获得了在仅剩n^{1−α}个顶点未被揭示时图匹配的首次精确统计和计算特征。我们的结果补充了最近在半监督社区检测方面的进展,展示了揭示除了n^{1−α}个对应关系外的所有顶点,同样会降低图匹配的信息阈值。

英文摘要:

We study graph matching between two correlated networks in the almost fully seeded regime, where all but a vanishing fraction of vertex correspondences are revealed. Concretely, we consider the correlated stochastic block model and assume that $n^{1-α}$ vertices remain unrevealed for some $α\in (0,1)$, while the remaining $n - n^{1-α}$ vertices are provided as seed correspondences. Our goal is to determine when the true permutation can be recovered efficiently as the proportion of unrevealed vertices vanishes. We prove that exact recovery of the remaining correspondences is achievable in polynomial time whenever $λs^{2} > 1 - α$, where $λ= (a+b)/2$ is the SBM density parameter and $s$ denotes the edge retention parameter. This condition smoothly interpolates between the fully seeded setting and the classical unseeded threshold $λs^{2} > 1$ for matching in correlated Erdős-Rényi graphs. Our analysis applies to both a simple neighborhood-overlap rule and a bistochastic relaxation followed by projection, establishing matching achievability in the almost fully seeded regime without requiring spectral methods or message passing. On the converse side, we show that below the same threshold, exact recovery is information-theoretically impossible with high probability. Thus, to our knowledge, we obtain the first tight statistical and computational characterization of graph matching when only a vanishing fraction of vertices remain unrevealed. Our results complement recent progress in semi-supervised community detection by demonstrating that revealing all but $n^{1-α}$ correspondences similarly lowers the information threshold for graph matching.

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

↑