arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.04058math.STmath.PRstat.TH
收藏

在随机图中寻找植入的环

Finding Planted Cycles in a Random Graph

Northwestern University(西北大学);École Polytechnique Fédérale de Lausanne(洛桑联邦理工学院);Duke University, The Fuqua School of Business(杜克大学福夸商学院);Cornell University, Department of Statistics and Data Science(康奈尔大学统计与数据科学系)

Julia Gaudio, Colin Sandon, Jiaming Xu, Dana Yang

AI总结:

该研究探讨了在随机图中寻找植入环的问题,证明了当λ满足特定条件时,几乎精确恢复是信息论上可能的,而设计了一个多项式时间算法实现这一目标,与植入聚类问题形成对比。

摘要:

在本文中,我们研究了在ER随机图G∼G(n,λ/n)中寻找一组植入环的问题,类似于著名的植入聚类问题。当环被植入在均匀随机选择的δn个顶点上时,我们证明,当λ<1/(√(2δ)+√(1−δ))²时,几乎精确恢复(即随着n→∞,恢复所有但极小比例的植入环边)在信息论上是可能的,而当λ>1/(√(2δ)+√(1−δ))²时是不可能的。此外,尽管寻找长环在最坏情况下计算上具有难度,我们设计了一个多项式时间算法,在λ<1/(√(2δ)+√(1−δ))²时实现几乎精确恢复。这与植入聚类问题形成鲜明对比,后者广泛认为存在显著的计算-统计差距。

英文摘要:

In this paper, we study the problem of finding a collection of planted cycles in an \ER random graph $G \sim \mathcal{G}(n, λ/n)$, in analogy to the famous Planted Clique Problem. When the cycles are planted on a uniformly random subset of $δn$ vertices, we show that almost-exact recovery (that is, recovering all but a vanishing fraction of planted-cycle edges as $n \to \infty$) is information-theoretically possible if $λ< \frac{1}{(\sqrt{2 δ} + \sqrt{1-δ})^2}$ and impossible if $λ> \frac{1}{(\sqrt{2 δ} + \sqrt{1-δ})^2}$. Moreover, despite the worst-case computational hardness of finding long cycles, we design a polynomial-time algorithm that attains almost exact recovery when $λ< \frac{1}{(\sqrt{2 δ} + \sqrt{1-δ})^2}$. This stands in stark contrast to the Planted Clique Problem, where a significant computational-statistical gap is widely conjectured.

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

↑