Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
We prove a hardness of sampling result for the anti-ferromagnetic Ising model on random
graphs of average degree $ d $ for large constant $ d $, proving that when the normalized …
graphs of average degree $ d $ for large constant $ d $, proving that when the normalized …
On the occupancy fraction of the antiferromagnetic Ising model
E Davies, O LeBlanc - arXiv preprint arXiv:2412.18070, 2024 - arxiv.org
We study the maximum and minimum occupancy fraction of the antiferromagnetic Ising
model in regular graphs. The minimizing problem is known to determine a computational …
model in regular graphs. The minimizing problem is known to determine a computational …
[PDF][PDF] Frontiers of Statistical Mechanics and Theoretical Computer Science
T Helmuth, J Gao, M Michelen, W Perkins, GU Bravo - 2024 - stats.birs.ca
Ties between statistical mechanics and theoretical computer science date back to the
earliest days of mechanical computers. A revolutionary example is the development of …
earliest days of mechanical computers. A revolutionary example is the development of …