Spectral Bounds for the Ising Ferromagnet on an Arbitrary Given Graph
arXiv:1609.08269 · doi:10.1088/1742-5468/aa6f1e
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.
arXiv comment17 pages, 1 figure
References in corpus (13)
- Direct-coupling analysis of residue co-evolution captures native contacts across many protein families
- Spectral redemption: clustering sparse networks
- 25th-order high-temperature expansion results for three-dimensional Ising-like systems on the simple cubic lattice
- Ising models on locally tree-like graphs
- Loop series for discrete statistical models on graphs
- Inverse Ising inference using all the data
- Adaptive Cluster Expansion for Inferring Boltzmann Machines with Noisy Data
- The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
- The Bethe Partition Function of Log-supermodular Graphical Models
- Efficient Exact Inference in Planar Ising Models
- Clustering from Sparse Pairwise Measurements
- Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation
- Non-backtracking operator for Ising model and its application in attractor neural networks