Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime

Consider a pair of sparse correlated stochastic block models $\mathcal S(n,\tfracλ{n},ε;s)$ subsampled from a common parent stochastic block model with two symmetric communities, average degree $λ=O(1)$, divergence parameter $ε\in (0,1)$ and subsampling probability $s$. For all $ε\in(0,1)$ and $Δ>0$, we construct a statistic based on the combination of two low-degree polynomials and show that there exists a sufficiently small constant $δ=δ(ε,λ,Δ)>0$ such that if $ε^2 λs>1+Δ$ and $s>\sqrtα-δ$ where $α\approx 0.338$ is Otter's constant, this statistic can distinguish this model and a pair of independent stochastic block models $\mathcal S(n,\tfrac{λs}{n},ε)$ with probability $1-o(1)$. We also provide an efficient algorithm that approximates this statistic in polynomial time. The crux of our statistic's construction lies in a carefully curated family of multigraphs called \emph{decorated trees}, which enables effective aggregation of the community signal and graph correlation by leveraging the counts of the same decorated tree while suppressing the undesirable correlations among counts of different decorated trees. We believe such construction may be of independent interest.