





















Consider a pair of correlated Erdős-Rényi graphs $\mathcal G(n,\tfracλ{n};s)$ that are subsampled from a common parent Erdős-Rényi graph with average degree $λ$ and subsampling probability $s$. We establish a sharp information-theoretic threshold for the detection problem between this model and two independent Erdős-Rényi graphs $\mathcal G(n,\tfracλ{n})$, showing that strong detection is information-theoretically possible if and only if $s>\min\{ \tfrac{1}{\sqrtλ}, \sqrtα \}$ where $α\approx 0.338$ is the Otter's constant. Our result resolves a constant gap between arXiv:2203.14573 and arXiv:2008.10097.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。