Zeros of ferromagnetic 2-spin systems
@article{Guo2020ZerosOF, title={Zeros of ferromagnetic 2-spin systems}, author={Heng Guo and J. Liu and Pinyan Lu}, journal={ArXiv}, year={2020}, volume={abs/1907.06156} }
We study zeros of the partition functions of ferromagnetic 2-state spin systems in terms of the external field, and obtain new zero-free regions of these systems via a refinement of Asano's and Ruelle's contraction method. The strength of our results is that they do not depend on the maximum degree of the underlying graph. Via Barvinok's method, we also obtain new efficient and deterministic approximate counting algorithms. In certain regimes, our algorithm outperforms all other methods such as… CONTINUE READING
5 Citations
Contraction: a Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
- Mathematics, Computer Science
- ICALP
- 2020
- 9
- PDF
The complexity of approximating the complex-valued Potts model
- Mathematics, Computer Science
- MFCS
- 2020
- PDF
More on zeros and approximation of the Ising partition function
- Mathematics, Computer Science
- ArXiv
- 2020
- PDF
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs
- Computer Science, Mathematics
- ArXiv
- 2020
- PDF
References
SHOWING 1-10 OF 41 REFERENCES
The Complexity of Ferromagnetic Two-spin Systems with External Fields
- Mathematics, Computer Science
- APPROX-RANDOM
- 2014
- 16
- PDF
The computational complexity of two-state spin systems
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2003
- 62
- PDF
Approximation Algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs
- Computer Science, Mathematics
- SODA
- 2012
- 111
- PDF
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
- Mathematics, Computer Science
- APPROX-RANDOM
- 2016
- 12
- PDF
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs
- Mathematics, Computer Science
- 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
- 2012
- 111
- PDF
The Ising Partition Function: Zeros and Deterministic Approximation
- Computer Science, Mathematics
- 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
- 2017
- 22
- PDF