Approximating partition functions of the two-state spin system

DOI10.1016/j.ipl.2011.04.012zbMath1260.68469MaRDI QIDQ1944117

Yanyan Li

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.04.012

zbMATH Keywords

Ising model; Gibbs measure; approximation algorithms; FPTAS; strong correlation decay; two-state spin system; uniqueness of Gibbs measure

Mathematics Subject Classification ID

05C90: Applications of graph theory

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

68W25: Approximation algorithms

Related Items

Unnamed Item, More on zeros and approximation of the Ising partition function, Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model, Unnamed Item, Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing, Fisher zeros and correlation decay in the Ising model, Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs, Fisher Zeros and Correlation Decay in the Ising Model, Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models, Unnamed Item, Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, Approximation Algorithms for the Random Field Ising Model, The Ising partition function: zeros and deterministic approximation, Exact thresholds for Ising-Gibbs samplers on general graphs, Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems, Zero-freeness and approximation of real Boolean Holant problems, Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs, Complexity of Ising Polynomials

Cites Work

• Ising models on locally tree-like graphs
• Gibbs measures and phase transitions
• Uniqueness of uniform random colorings of regular trees
• The Ising model and percolation on trees and tree-like graphs
• The critical Ising model on trees, concave recursions and nonlinear capacity
• Counting independent sets up to the tree threshold
• Rapid mixing of Gibbs sampling on graphs that are sparse on average
• Polynomial-Time Approximation Algorithms for the Ising Model
• Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
• The computational complexity of two‐state spin systems
• Prescribing a System of Random Variables by Conditional Distributions
• Combinatorial criteria for uniqueness of Gibbs measures