在随机图中检测局部几何:信息论和计算限制
Detection of local geometry in random graphs: information-theoretic and computational limits
AI总结:
研究随机图中局部几何检测的理论与计算限制,提出混合模型并分析信息论和计算阈值。
摘要:
我们研究了在随机图中检测局部几何的问题。我们引入了一个模型$\mathcal{G}(n, p, d, k)$,其中隐藏社区的平均大小为$k$,其边由在$\mathbb{S}^{d-1}$上的随机几何图生成,而其余边遵循Erdős--Rényi模型$\mathcal{G}(n, p)$。随机几何图通过阈值化潜在向量在$\mathbb{S}^{d-1}$上的内积生成,每条边的边际概率等于$p$。这表明$\mathcal{G}(n, p, d, k)$和$\mathcal{G}(n, p)$在边际层面是不可区分的,信号完全体现在由局部几何诱导的边依赖中。我们研究了检测的理论和计算限制。在信息论方面,我们的上界来自三种基于符号三角形计数的测试:全局测试、扫描测试和约束扫描测试;我们的下界来自两种互补方法:截断二次矩通过Wishart--GOE比较,以及KL散度的张量化。这些结果共同确定了检测阈值为$d = \widetilde{Θ}(k^2 \vee k^6/n^3)$对于固定$p$,并扩展了从全模型(即$k = n$)的最先进界限到消失$p$的情况。在计算方面,我们识别了一个计算-统计间隙,并通过低度多项式框架以及符号循环计数的亚最优性提供了证据。
英文摘要:
We study the problem of detecting local geometry in random graphs. We introduce a model $\mathcal{G}(n, p, d, k)$, where a hidden community of average size $k$ has edges drawn as a random geometric graph on $\mathbb{S}^{d-1}$, while all remaining edges follow the Erdős--Rényi model $\mathcal{G}(n, p)$. The random geometric graph is generated by thresholding inner products of latent vectors on $\mathbb{S}^{d-1}$, with each edge having marginal probability equal to $p$. This implies that $\mathcal{G}(n, p, d, k)$ and $\mathcal{G}(n, p)$ are indistinguishable at the level of the marginals, and the signal lies entirely in the edge dependencies induced by the local geometry. We investigate both the information-theoretic and computational limits of detection. On the information-theoretic side, our upper bounds follow from three tests based on signed triangle counts: a global test, a scan test, and a constrained scan test; our lower bounds follow from two complementary methods: truncated second moment via Wishart--GOE comparison, and tensorization of KL divergence. These results together settle the detection threshold at $d = \widetildeΘ(k^2 \vee k^6/n^3)$ for fixed $p$, and extend the state-of-the-art bounds from the full model (i.e., $k = n$) for vanishing $p$. On the computational side, we identify a computational--statistical gap and provide evidence via the low-degree polynomial framework, as well as the suboptimality of signed cycle counts of length $\ell \geq 4$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。