We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for the limiting free energy per spin is correct for any positive temperature and external field. Further, local marginals can be approximated by iterating a set of mean field (cavity) equations. Both results are achieved by proving the local convergence of the Boltzmann distribution on the original graph to the Boltzmann distribution on the appropriate infinite random tree.
We study the ferromagnetic Ising model on the infinite $d$-regular tree under the free boundary condition. This model is known to be a factor of IID in the uniqueness regime, when the inverse temperature $β\ge 0$ satisfies $\tanh β\le (d-1)^{-1}$. However, in the reconstruction regime ($\tanh β> (d-1)^{-\frac{1}{2}}$), it is not a factor of IID. We construct a factor of IID for the Ising model beyond the uniqueness regime via a strong solution to an infinite dimensional stochastic differential equation which partially answers a question of Lyons. The solution $\{X_t(v) \}$ of the SDE is distri…
We consider the ferromagnetic Ising model on the Cayley tree and we investigate the decomposition of the free state into extremal states below the spin glass temperature. We show that this decomposition has uncountably many components. The tail observable showing that the free state is not extremal is related to the Edwards-Anderson parameter, measuring the variance of the (random) magnetization obtained from drawing boundary conditions from the free state.
In this article we show the convergence of a loop ensemble of interfaces in the FK Ising model at criticality, as the lattice mesh tends to zero, to a unique conformally invariant scaling limit. The discrete loop ensemble is described by a canonical tree glued from the interfaces, which then is shown to converge to a tree of branching SLEs. The loop ensemble contains unboundedly many loops and hence our result describes the joint law of infinitely many loops in terms of SLE type processes, and the result gives the full scaling limit of the FK Ising model in the sense of random geometry of the …
Splitting Gibbs Measures for a Periodic Triple Mixed-Spin Ising Model on a Cayley Tree
The United Arab Emirates University（阿联酋大学）；V.I. Romanovskiy Institute of Mathematics, Uzbekistan Academy of Sciences（乌兹别克斯坦科学院 V.I.罗曼诺夫斯基数学研究所）；Oriental University（东方大学）
Let $G$ be the product of finitely many trees $T_1\times T_2 \times \cdots \times T_N$, each of which is regular with degree at least three. We consider Bernoulli bond percolation and the Ising model on this graph, giving a short proof that the model undergoes a second order phase transition with mean-field critical exponents in each case. The result concerning percolation recovers a result of Kozma (2013), while the result concerning the Ising model is new. We also present a new proof, using similar techniques, of a lemma of Schramm concerning the decay of the critical two-point function alon…
We consider the ferromagnetic n.n Ising model on Cayley trees in absence of external fields submitted to a modified majority rule transformation with overlapping cells already known to lead to non-Gibbsian measures. We describe the renormalized measures within the Generalized Gibbs framework and prove that they are Almost Gibbs at any temperature.
We prove rigorously that the ferromagnetic Ising model on any nonamenable Cayley graph undergoes a continuous (second-order) phase transition in the sense that there is a unique Gibbs measure at the critical temperature. The proof of this theorem is quantitative and also yields power-law bounds on the magnetization at and near criticality. Indeed, we prove more generally that the magnetization $\langle σ_o \rangle_{β,h}^+$ is a locally Hölder-continuous function of the inverse temperature $β$ and external field $h$ throughout the non-negative quadrant $(β,h)\in [0,\infty)^2$. As a second appli…
Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose complexity is $O(nkL)$, and that achieves near optimal cut values among all $L$-local algorithms. Focusing on max-cut, the algorithm constructs a cut of value $nk/4+ n\mathsf{P}_\star\sqrt{k/4}+\mathsf{err}(n,k,L)$, where $\mathsf{P}_\star\approx 0.763166$ is the value of the Parisi formula from spin glass theory, and $\mathsf{err}(n,k,L)=o_n(n)+no_k(\sqrt{k})+n \sq…
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This class includes in particular the configuration model and the family of inhomogeneous random graphs with rank-1 kernel. Vertices in the graph are allowed to have attributes on a general separable metric space and can potentially influence the construction of the graph itself. The coupling holds for any fixed depth of a breadth-first exploration process.
