Fast Mixing in Sparse Random Ising Models

Motivated by the community detection problem in Bayesian inference, as well as the recent explosion of interest in spin glasses from statistical physics, we study the classical Glauber dynamics for sampling from Ising models with sparse random interactions. It is now well-known that when the interaction matrix has spectral diameter less than $1$, Glauber dynamics mixes in $O(n\log n)$ steps. Unfortunately, such criteria fail dramatically for interactions supported on arguably the most well-studied sparse random graph: the Erdős--Rényi random graph $G(n,d/n)$, due to the presence of almost linearly many outlier eigenvalues of unbounded magnitude. We prove that for the \emph{Viana--Bray spin glass}, where the interactions are supported on $G(n,d/n)$ and randomly assigned $\pmβ$, Glauber dynamics mixes in $n^{1+o(1)}$ time with high probability as long as $β\le O(1/\sqrt{d})$, independent of $n$. We further extend our results to random graphs drawn according to the $2$-community stochastic block model, as well as when the interactions are given by a "centered" version of the adjacency matrix. The latter setting is particularly relevant for the inference problem in community detection. Indeed, we use this to show that Glauber dynamics succeeds at recovering communities in the stochastic block model in a companion paper [LMR+24]. The primary technical ingredient in our proof is showing that with high probability, a sparse random graph can be decomposed into two parts -- a \emph{bulk} which behaves like a graph with bounded maximum degree and a well-behaved spectrum, and a \emph{near-forest} with favorable pseudorandom properties. We then use this decomposition to design a localization procedure that interpolates to simpler Ising models supported only on the near-forest, and then execute a pathwise analysis to establish a modified log-Sobolev inequality.