加权随机图的依赖性检验
Testing Dependency of Weighted Random Graphs
AI总结:
本文研究检测两个加权随机图间边依赖性的假设检验问题,推导了最优检验的信息论阈值,并利用低阶多项式框架证明了其中存在的固有统计-计算差距。
摘要:
在本文中,我们研究检测两个加权随机图之间边依赖性的任务。我们将该任务表述为一个简单的假设检验问题:在零假设下,两个观测图在统计上是独立的;而在备择假设下,一个图的边依赖于另一个图的一致随机顶点置换版本的边。对于一般的边权重分布,我们确定了最优检验在信息论上成为可能或不可能的阈值,该阈值是观测图中节点总数和权重生成分布的函数。最后,我们识别出统计-计算差距,并使用低阶多项式框架提供证据表明该差距是固有的。
英文摘要:
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically independent, whereas under the alternative, the edges of one graph are dependent on the edges of a uniformly and randomly vertex-permuted version of the other graph. For general edge-weight distributions, we establish thresholds at which optimal testing becomes information-theoretically possible or impossible, as a function of the total number of nodes in the observed graphs and the generative distributions of the weights. Finally, we identify a statistical-computational gap, and present evidence suggesting that this gap is inherent using the framework of low-degree polynomials.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。