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 consider the ferromagnetic Ising model with spatially dependent external fields on a Cayley tree, and we investigate the conditions for the existence of the phase transition for a class of external fields, asymptotically approaching a homogeneous critical external field. Our results extend earlier results by Rozikov and Ganikhodjaev.
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.
It is known that the Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels. In this paper, we will adopt a refined analysis of moment recursion on a weighted version of the magnetization, which is engaged in Sly [2011] to handle the symmetric Potts model, and establish the critical condition of the asymmetric Ising model to make Kesten-Stigum bound the reconstruction threshold on regular $d$-ary trees.
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…
Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core model. Let $λ_c(T_Δ)$ denote the critical activity for the hard-model on the infinite $Δ$-regular tree. Weitz presented an FPTAS for the partition function when $λ<λ_c(T_Δ)$ for graphs with constant maximum degree $Δ$. In contrast, Sly showed that for all $Δ\geq 3$, there exists $ε_Δ>0$ such that (unless RP=NP) there is no FPRAS for approximating the partition fu…
We study the problem of learning a tree Ising model from samples such that subsequent predictions made using the model are accurate. The prediction task considered in this paper is that of predicting the values of a subset of variables given values of some other subset of variables. Virtually all previous work on graphical model learning has focused on recovering the true underlying graph. We define a distance ("small set TV" or ssTV) between distributions $P$ and $Q$ by taking the maximum, over all subsets $\mathcal{S}$ of a given size, of the total variation between the marginals of $P$ and …
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…
Consider a statistical physical model on the $d$-regular infinite tree $T_{d}$ described by a set of interactions $Φ$. Let $\{G_{n}\}$ be a sequence of finite graphs with vertex sets $V_n$ that locally converge to $T_{d}$. From $Φ$ one can construct a sequence of corresponding models on the graphs $G_n$. Let $\{μ_n\}$ be the resulting Gibbs measures. Here we assume that $\{μ_{n}\}$ converges to some limiting Gibbs measure $μ$ on $T_{d}$ in the local weak$^*$ sense, and study the consequences of this convergence for the specific entropies $|V_n|^{-1}H(μ_n)$. We show that the limit supremum of $…
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.
We consider the ferromagnetic nearest-neighbor Ising model on regular trees (Bethe lattice), which is well-known to undergo a phase transition in the absence of an external magnetic field. The behavior of the model at critical temperature can be described in terms of various critical exponents; one of them is the critical 1-arm exponent $ρ$, which characterizes the rate of decay of the (root) magnetization. The crucial quantity we analyze in this work is the thermal expectation of the root spin on a finite subtree, where the expected value is taken with respect to a probability measure related…
In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed their choice have a latent period, which is exponential with rate $λ$, during which they will not buy a new device. We study site and edge versions of this model on random graphs generated by a configuration model in which the degrees $d(x)$ have $3 \le d(x) \le M$. We show that if the number of vertices $n \to\infty$ and $\log n \ll λ_n \ll n$ then the latent voter model has a quasi-stationary state in which each opinion has probability $\approx 1/2$ and persists in t…
