Spectral bounds for the Ising ferromagnet on an arbitrary given graph

DOI10.1088/1742-5468/AA6F1EMaRDI QIDQ3303065zbMATH OpenOpenAlexWikidataFDO

Authors Alaa Saade, Florent Krzakala, Lenka Zdeborová

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.08269

Mathematics Subject Classification ID

Statistical mechanics of magnetic materials (82D40)

Abstract: We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results are valid on any finite graph, with arbitrary topology and arbitrary positive couplings and fields. Our results are based on high temperature expansions of the aforementioned quantities, and are expressed in terms of two related linear operators: the non-backtracking operator and the Bethe Hessian. As a by-product, we show that in a well-defined high-temperature region, the susceptibility propagation algorithm converges and provides an upper bound on the true spin-spin correlations.

Recommendations

• Ferromagnetic Ising measures on large locally tree-like graphs
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
• A lower bound on the spectral gap of the 3-dimensional stochastic Ising models
• Absence of spontaneous magnetization for the Ising model on weakly separable graphs
• The Ising model on diluted graphs and strong amenability
• Ising models on hyperbolic graphs
• Zero-temperature dynamics for the ferromagnetic Ising model on random graphs
• The spectral gap of the 2-D stochastic Ising model with nearly single-spin boundary conditions
• Fluctuations of the magnetization for Ising models on dense Erdős-Rényi random graphs

Cites work

• A Combinatorial Solution of the Two-Dimensional Ising Model
• A New Class of Upper Bounds on the Log Partition Function
• Computational implications of reducing data to sufficient statistics
• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• GPU accelerated Monte Carlo simulation of the 2D and 3D Ising model
• Graphical models, exponential families, and variational inference
• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• scientific article; zbMATH DE number 3195308 (Why is no real title available?)
• Information, Physics, and Computation
• Ising critical exponents on random trees and graphs
• Ising models on locally tree-like graphs
• Loop series for discrete statistical models on graphs
• Polynomial-Time Approximation Algorithms for the Ising Model
• Probabilistic graphical models.
• Spectral redemption in clustering sparse networks

Cited in

(5)

• Ising model observables and non-backtracking walks
• Ising spin glass models versus Ising models: an effective mapping at high temperature. II: Applications to graphs and networks
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
• scientific article; zbMATH DE number 7626732 (Why is no real title available?)
• Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations

Describes a project that uses

Uses Software

• Ace

This page was built for publication: Spectral bounds for the Ising ferromagnet on an arbitrary given graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303065)