Counting and Sampling Anti-Ferromagnetic Potts Models on Random Regular Bipartite Graphs in the Non-uniqueness Regime

2026-06-19

AI Summary

This work investigates the approximation of the partition function of the antiferromagnetic Potts model on random regular bipartite graphs at low temperatures. Addressing the computational hardness in the non-uniqueness regime, it extends the abstract polymer model framework—previously applied to ferromagnetic or hard-core systems—to the antiferromagnetic Potts setting for the first time. By leveraging graph expansion properties and analyzing the mixing time of Markov chains, the study establishes exponentially slow mixing of single-site Glauber dynamics. Building on this insight, the authors develop the first deterministic polynomial-time approximation algorithm for the partition function in this regime, thereby uncovering a profound connection between phase transitions and computational complexity.

Abstract

The anti-ferromagnetic multi-state Potts model, a generalization of the Ising model, is one of the most fundamental models in statistical physics. It was conjectured by Kotecký (Phys.~Rev.~B, 1985) that the model undergoes a phase transition from a disordered phase at infinite temperature to an ordered phase at sufficiently low temperature on lattices. Such phase transitions are believed to play an important role in computational complexity theory and remain closely connected to the problem of approximating the partition function of the system. For proper three-coloring models (corresponding to the zero-temperature), torpid mixing of a family of local-update Markov chains on lattices was established by Galvin, Kahn, Randall and Sorkin (SIDMA, 2015), coinciding with the presence of phase coexistence following shown by Feldheim and Spinka (J.~Eur.~Math.~Soc., 2019). In this work, we study approximating the partition function of the anti-ferromagnetic multi-state Potts model at low temperature on random regular bipartite graphs, which are with high probability good bipartite expanders. On the negative side, we generalize the result by Geisler, Kang, Sarantis and Wdowinski (arXiv, 2026) for anti-ferromagnetic Ising models to show that when the temperature is sufficiently low relative to the degree of the underlying graph, the celebrated single-site Glauber dynamics has exponentially slow mixing time. On the positive side, we design a deterministic algorithm that yields an approximation to the partition function of the model via the framework of abstract polymer models as Jenssen, Keevash and Perkins (SICOMP, 2020), Liao, Lin, Lu and Mao (Theor.~Comput.~Sci., 2022), Galanis, Goldberg and Stewart (TOCT, 2021) and Geisler, Kang, Sarantis and Wdowinski (arXiv, 2026).

Problem

• anti-ferromagnetic Potts model
• partition function
• random regular bipartite graphs
• non-uniqueness regime
• approximation

Innovation

• anti-ferromagnetic Potts model
• partition function approximation
• abstract polymer models
• random regular bipartite graphs
• Glauber dynamics