Search arXivSearch

arXiv · 2511.16620

Fixed-magnetization Ising on random graphs up to reconstruction

Abstract

We study the fixed-magnetization ferromagnetic Ising model on random $d$-regular graphs for $d\ge 3$ and inverse temperature below the tree reconstruction threshold. Our main result is that for each magnetization $η$, the free energy density of the fixed-magnetization Ising model converges to the annealed free energy density, itself the Bethe free energy of an Ising measure on the infinite $d$-regular tree. Moreover, the fixed-magnetization Ising model exhibits local weak convergence to this tree measure. A key challenge to proving these results is that for magnetizations between the model's spinodal points, the limiting tree measure corresponds to an unstable fixed point of the belief propagation equations. As an application, we prove that the positive-temperature Zdeborová--Boettcher conjecture on max-cut and min-bisection holds up to the reconstruction threshold: on the random $d$-regular graph, the expected fraction of bichromatic edges in the anti-ferromagnetic Ising model plus the expected fraction of bichromatic edges in the zero-magnetization ferromagnetic Ising model equals $1+o(1)$. A second application is completely determining the large deviation rate function for the magnetization in the Ising model on the random regular graph up to reconstruction. Finally, we use the precise understanding of this rate function to show that the Glauber dynamics for the full Ising model on the random graph mixes in sub-exponential time from uniformly random initialization, well into the non-uniqueness regime where the worst-case initialization mixing time is exponentially slow.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Reza Gheissari, Will Perkins, Corrine Yap. 2025-11-20. Fixed-magnetization Ising on random graphs up to reconstruction. https://arxiv.org/abs/2511.16620

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR