Ising models on locally tree-like graphs
نویسندگان
چکیده
We consider 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 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.
منابع مشابه
The weak limit of Ising models on locally tree-like graphs
We consider the Ising model with inverse temperature β and without external field on sequences of graphs Gn which converge locally to the k-regular tree. We show that for such graphs the Ising measure locally weak converges to the symmetric mixture of the Ising model with + boundary conditions and the − boundary conditions on the k-regular tree with inverse temperature β. In the case where the ...
متن کاملFerromagnetic Ising Measures on Large Locally Tree-like Graphs by Anirban Basak
We consider the ferromagnetic Ising model on a sequence of graphs Gn converging locally weakly to a rooted random tree. Generalizing [Probab. Theory Related Fields 152 (2012) 31–51], under an appropriate “continuity” property, we show that the Ising measures on these graphs converge locally weakly to a measure, which is obtained by first picking a random tree, and then the symmetric mixture of ...
متن کاملar X iv : h ep - l at / 9 70 40 20 v 1 3 0 A pr 1 99 7 Potts Models on Feynman Diagrams
We investigate numerically and analytically Potts models on " thin " random graphs – generic Feynman diagrams, using the idea that such models may be expressed as the N → 1 limit of a matrix model. The thin random graphs in this limit are locally tree-like, in distinction to the " fat " random graphs that appear in the planar Feynman diagram limit, N → ∞, more familiar from discretized models o...
متن کاملLatent Graphical Model Selection: Efficient Methods for Locally Tree-like Graphs
Graphical model selection refers to the problem of estimating the unknown graph structure given observations at the nodes in the model. We consider a challenging instance of this problem when some of the nodes are latent or hidden. We characterize conditions for tractable graph estimation and develop efficient methods with provable guarantees. We consider the class of Ising models Markov on loc...
متن کاملIsing spin glass models versus Ising models: an effective mapping at high temperature III. Rigorous formulation and detailed proof for general graphs
Recently, it has been shown that, when the dimension of a graph turns out to be infinite dimensional in a broad sense, the upper critical surface and the corresponding critical behavior of an arbitrary Ising spin glass model defined over such a graph, can be exactly mapped on the critical surface and behavior of a non random Ising model. A graph can be infinite dimensional in a strict sense, li...
متن کامل