Metraipolis › archive › dc_a28dc0bfba3d

On Zeros and Algorithms for Disordered Systems II: The Antiferromagnetic Ising Model up to Kesten-Stigum — arXiv:2610.40598

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40598
License (as archived)
CC0-1.0
Archived
2026-11-01T02:35:45.481Z
SHA-256 of the archived text
6ae00ba0a4b2ab2ce5a8c774177c48604e71fbb8b66615cdfdd8f4a3084138f8
Stable URL of this page
https://metraipolis.com/documento/dc_a28dc0bfba3d

How to cite

On Zeros and Algorithms for Disordered Systems II: The Antiferromagnetic Ising Model up to Kesten-Stigum — arXiv:2610.40598 — arXiv (en), https://arxiv.org/abs/2610.40598 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a28dc0bfba3d (Metraipolis archive dc_a28dc0bfba3d, sha256 6ae00ba0a4b2ab2ce5a8c774177c48604e71fbb8b66615cdfdd8f4a3084138f8)
BibTeX
@misc{dca28dc0bfba3d,
  title = {On Zeros and Algorithms for Disordered Systems II: The Antiferromagnetic Ising Model up to Kesten-Stigum — arXiv:2610.40598},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40598},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a28dc0bfba3d; sha256 6ae00ba0a4b2ab2ce5a8c774177c48604e71fbb8b66615cdfdd8f4a3084138f8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40598. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give the first polynomial-time algorithm to estimate the partition function of the antiferromagnetic Ising model on the uniformly random $d$-regular graph to arbitrarily high accuracy for all inverse temperatures up to the Kesten-Stigum threshold. This is the entire regime in which the model is "replica symmetric," and is conjectured to be optimal for polynomial-time counting and sampling. To achieve our algorithmic result, we establish the absence of Fisher zeros for the partition function in a constant-width strip around the interval from $0$ up to the Kesten-Stigum threshold, with high probability over the randomness of the input graph. AI Disclosure: The overarching vision and proof architecture were developed solely by the authors without AI input. GPT 5.5 Pro was used, with extensive guidance from the authors, for only a few minor technical aspects of the proof. The authors independently verified correctness and wrote everything by hand. We take full responsibility for its contents. A more detailed statement can be found in Section 1.2.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Disordered Systems and Neural Networks (cond-mat.dis-nn); Mathematical Physics (math-ph); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.40598 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:14:58.679Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).