arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.14501math.STmath.PRstat.TH
收藏

随机几何图中 $L_\infty$ 几何的检测:三角形与团簇展开的次优性

Detection of $L_\infty$ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion

Kiril Bangachev, Guy Bresler

AI总结:

本文研究了具有 $L_q$ 距离的随机几何图与 Endos-Rényi 图的区分问题,发现在 $L_\infty$ 设置下,计数符号 4-循环是最优低度测试,而符号三角形测试是次优的,与 $L_2$ 几何文献结论形成对比。

摘要:

本文研究了具有 $L_q$ 距离的随机几何图 $\mathsf{RGG}(n,\mathbb{T}^d,\mathsf{Unif},σ^q_p,p)$,其中每个顶点从 $d$ 维环面均匀采样,且连接半径的选择使得边缘概率为 $p$。除了探讨其他问题的结果外,我们在确定何时能够将 $\mathsf{RGG}(n,\mathbb{T}^d,\mathsf{Unif},σ^q_p,p)$ 与 Endos-Rényi 图 $\mathsf{G}(n,p)$ 区分开方面取得了进展。我们最强的结果是在 $q = \infty$ 的极端设置下,此时 $\mathsf{RGG}(n,\mathbb{T}^d,\mathsf{Unif},σ^\infty_p,p)$ 是 $d$ 个 1 维随机几何图的 $\mathsf{AND}$。我们推导了一个类似于统计物理中团簇展开的公式,捕捉了来自 $d$ 个 1 维副本的子图的兼容性,并用它来界定小子图的符号期望。我们证明,在所有低度测试中,计数符号 4-循环是最优的,当且仅当 $d = \tilde{o}(np)$ 时以高概率成功。相比之下,符号三角形测试是次优的,仅在 $d = \tilde{o}((np)^{3/4})$ 时成功。我们的结果与现有的随机几何图文献(主要关注 $L_2$ 几何)形成了鲜明对比,后者中符号三角形统计量是最优的。

英文摘要:

In this paper we study the random geometric graph $\mathsf{RGG}(n,\mathbb{T}^d,\mathsf{Unif},σ^q_p,p)$ with $L_q$ distance where each vertex is sampled uniformly from the $d$-dimensional torus and where the connection radius is chosen so that the marginal edge probability is $p$. In addition to results addressing other questions, we make progress on determining when it is possible to distinguish $\mathsf{RGG}(n,\mathbb{T}^d,\mathsf{Unif},σ^q_p,p)$ from the Endos-Rényi graph $\mathsf{G}(n,p)$. Our strongest result is in the extreme setting $q = \infty$, in which case $\mathsf{RGG}(n,\mathbb{T}^d,\mathsf{Unif},σ^\infty_p,p)$ is the $\mathsf{AND}$ of $d$ 1-dimensional random geometric graphs. We derive a formula similar to the cluster-expansion from statistical physics, capturing the compatibility of subgraphs from each of the $d$ 1-dimensional copies, and use it to bound the signed expectations of small subgraphs. We show that counting signed 4-cycles is optimal among all low-degree tests, succeeding with high probability if and only if $d = \tilde{o}(np).$ In contrast, the signed triangle test is suboptimal and only succeeds when $d = \tilde{o}((np)^{3/4}).$ Our result stands in sharp contrast to the existing literature on random geometric graphs (mostly focused on $L_2$ geometry) where the signed triangle statistic is optimal.

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

↑