Approximation algorithms for the random-field Ising model

08/26/2021
by   Tyler Helmuth, et al.
0

Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation scheme exists. This motivates an average-case question: are there classes of instances for which polynomial-time approximation schemes exist? We investigate this question for the random field Ising model on graphs with maximum degree Δ. We establish the existence of fully polynomial-time approximation schemes and samplers with high probability over the random fields if the external fields are IID Gaussians with variance larger than a constant depending only on the inverse temperature and Δ. The main challenge comes from the positive density of vertices at which the external field is small. These regions, which may have connected components of size Θ(log n), are a barrier to algorithms based on establishing a zero-free region, and cause worst-case analyses of Glauber dynamics to fail. The analysis of our algorithm is based on percolation on a self-avoiding walk tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2018

Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs

We study the problem of approximating the Ising model partition function...
research
08/29/2022

Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs

Extending the work of Alon, Frieze abnd Welsh, we show that there are ra...
research
04/29/2023

Toward L_∞-recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random Fields

Many machine learning applications require learning a function with a sm...
research
12/03/2008

Strong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains

We prove Gibbs distribution of two-state spin systems(also known as bina...
research
12/10/2012

A class of random fields on complete graphs with tractable partition function

The aim of this short note is to draw attention to a method by which the...
research
04/11/2022

On complex roots of the independence polynomial

It is known from the work of Shearer (1985) (and also Scott and Sokal (2...
research
02/16/2018

The Vertex Sample Complexity of Free Energy is Polynomial

We study the following question: given a massive Markov random field on ...

Please sign up or login with your details

Forgot password? Click here to reset