arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.00305math.STcs.ITcs.SImath.ITstat.MLstat.TH
收藏

植入稠密环的信息论阈值

Information-Theoretic Thresholds for Planted Dense Cycles

Cheng Mao, Alexander S. Wein, Shenduo Zhang

AI总结:

针对小世界网络的随机图模型,研究植入稠密环的检测与恢复问题,刻画了基于n、τ和边信噪比λ的信息论阈值,证实该问题存在统计-计算间隙。

摘要:

我们研究了一种用于小世界网络的随机图模型,这类网络在社会科学与生命科学中普遍存在。在该模型中,一个期望带宽为$nτ$、代表顶点隐藏一维几何结构的稠密环被植入到含$n$个顶点的环境随机图中。针对植入稠密环的检测与恢复问题,我们依据$n$、$τ$以及边信噪比$λ$刻画了对应的信息论阈值。特别地,这些信息论阈值与近期一项针对低次多项式算法的研究中确立的计算阈值存在差异,从而证实了该问题存在统计-计算间隙。

英文摘要:

We study a random graph model for small-world networks which are ubiquitous in social and biological sciences. In this model, a dense cycle of expected bandwidth $n τ$, representing the hidden one-dimensional geometry of vertices, is planted in an ambient random graph on $n$ vertices. For both detection and recovery of the planted dense cycle, we characterize the information-theoretic thresholds in terms of $n$, $τ$, and an edge-wise signal-to-noise ratio $λ$. In particular, the information-theoretic thresholds differ from the computational thresholds established in a recent work for low-degree polynomial algorithms, thereby justifying the existence of statistical-to-computational gaps for this problem.

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

↑