arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.08421cond-mat.dis-nncs.DSmath.PRmath.STstat.TH
收藏

稀疏相关Erdös-Rényi随机图对齐的更快算法

Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs

Andrea Muratori, Guilhem Semerjian

AI总结:

针对稀疏相关Erdös-Rényi随机图对齐问题,本文提出一族更快算法,在保持较高精度的同时降低计算复杂度,并推测其相变阈值由修正Otter常数刻画。

摘要:

相关Erdös-Rényi随机图系综是定义在具有$n$个顶点的图对上的概率律,由平均度$λ$和相关系数$s$参数化。它可作为图对齐问题的基准:其中一个图的顶点标签被未知置换打乱,目标是推断该置换,从而正确匹配两个图中的顶点对。最近一系列工作揭示了Otter常数$α$(它控制无标号有根树数量随其大小增长的指数速率)在该问题中的作用:当$s>\sqrtα$且$λ$足够大时,可以在关于$n$的多项式时间内恢复隐藏置换的一个正比例部分。然而,该多项式增长的指数相当大,并且依赖于其他参数,这限制了该算法的应用范围。本文提出了一族用于此任务的更快算法,通过数值模拟表明其精度相对于原算法仅略有下降,并推测在$λ$较大极限下,这些算法会在修正的Otter阈值$\sqrt{\widehatα}>\sqrtα$处发生相变,其中$\widehatα$与一类受限树的计数有关。

英文摘要:

The correlated Erdös-Rényi random graph ensemble is a probability law on pairs of graphs with $n$ vertices, parametrized by their average degree $λ$ and their correlation coefficient $s$. It can be used as a benchmark for the graph alignment problem, in which the labels of the vertices of one of the graphs are reshuffled by an unknown permutation; the goal is to infer this permutation and thus properly match the pairs of vertices in both graphs. A series of recent works has unveiled the role of Otter's constant $α$ (that controls the exponential rate of growth of the number of unlabeled rooted trees as a function of their sizes) in this problem: for $s>\sqrtα$ and $λ$ large enough it is possible to recover in a time polynomial in $n$ a positive fraction of the hidden permutation. The exponent of this polynomial growth is however quite large and depends on the other parameters, which limits the range of applications of the algorithm. In this work we present a family of faster algorithms for this task, show through numerical simulations that their accuracy is only slightly reduced with respect to the original one, and conjecture that they undergo, in the large $λ$ limit, phase transitions at modified Otter's thresholds $\sqrt{\widehatα}>\sqrtα$, with $\widehatα$ related to the enumeration of a restricted family of trees.

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

↑