对齐多个非齐次随机图:精确恢复的基本极限
Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
AI总结:
本文研究了多个相关图恢复对应关系的基本极限,提出一种先两两部分匹配再利用传递性合并的算法,证明了其在齐次图设定下达到信息论阈值,并揭示了利用多图实现精确匹配的场景。
摘要:
本研究探讨了在多个相关图中恢复其潜在对应关系的基本极限。在非齐次随机图的设定下,我们提出并分析了一种匹配算法:首先两两部分匹配图,然后利用传递性合并这些部分匹配。我们的分析得出了一个问题参数的充分条件,以精确匹配所有图中的全部节点。在齐次(Erdős-Rényi)图的设定下,我们证明该条件也是必要的,即该算法的性能达到了信息论阈值。这揭示了一种场景:仅对两图进行精确匹配是不可能的,但利用两个以上的图则能在所有图间实现精确匹配。在非齐次设定下也给出了反结论,传递性再次发挥了作用。在此过程中,我们还推导出了关于非齐次随机图 k-core 的独立结论。
英文摘要:
This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs pairwise and then combine the partial matchings by transitivity. Our analysis yields a sufficient condition on the problem parameters to exactly match all nodes across all the graphs. In the setting of homogeneous (Erdős-Rényi) graphs, we show that this condition is also necessary, i.e. the algorithm works down to the information theoretic threshold. This reveals a scenario where exact matching between two graphs alone is impossible, but leveraging more than two graphs allows exact matching among all the graphs. Converse results are also given in the inhomogeneous setting and transitivity again plays a role. Along the way, we derive independent results about the k-core of inhomogeneous random graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。