The complexity of approximately counting in 2-spin systems on $k$-uniform bounded-degree hypergraphs

@article{Galanis2016TheCO,
  title={The complexity of approximately counting in 2-spin systems on \$k\$-uniform bounded-degree hypergraphs},
  author={Andreas Galanis and Leslie Ann Goldberg},
  journal={Inf. Comput.},
  year={2016},
  volume={251},
  pages={36-66}
}
One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This classification is based on a beautiful connection to the so-called uniqueness phase transition from statistical physics on the infinite ∆-regular tree. Our objective is to study the impact of this classification on unweighted 2-spin models on k-uniform… CONTINUE READING
Tweets
This paper has been referenced on Twitter 2 times. VIEW TWEETS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…