Counting in two-spin models on \(d\)-regular graphs
type: Item
instance of: scholarly article
title: Counting in two-spin models on \(d\)-regular graphs
zbMATH Open document ID: 1311.60117
DOI: 10.1214/13-AOP888
author: Allan Sly
author: Nike Sun
published in: The Annals of Probability
publication date: 2014-11-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1203.2602
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 82B20
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6369478
zbMATH Keywords: two-spin models
zbMATH Keywords: \(d\)-regular graphs
zbMATH Keywords: independent sets
zbMATH Keywords: anti-ferromagnetic Ising model
zbMATH Keywords: locally tree-like graphs
zbMATH Keywords: hard-core model
zbMATH Keywords: Bethe free energy
zbMATH Keywords: Gibbs uniqueness threshold
MaRDI profile type: Publication
arXiv ID: 1203.2602
Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Recommended article: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Recommended article: Approximating the partition function of planar two-state spin systems
Recommended article: The computational complexity of two‐state spin systems
Recommended article: Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model
Recommended article: Algorithms for #BIS-Hard Problems on Expander Graphs
Recommended article: Fast Algorithms for General Spin Systems on Bipartite Expanders
reviewed by: Maria C. Mariani
description: scientific article; zbMATH DE number 6369478