no. 16 · Tuesday 17 November 2026
The Mézard-Parisi formula for diluted Potts models
Abstract
We obtain the Mézard-Parisi formula for the antiferromagnetic Potts model on random uniform hypergraphs, including the Erdős-Rényi graph. The upper bound in the graph case was proved by Contucci, Dommers, Giardinà, and Starr, whose interpolation extends to uniform hypergraphs. Here we prove the matching lower bound for a general class of diluted models with finite spin alphabets. The proof follows closely the corresponding argument for diluted Ising models, so we outline only the adjustments needed for several colors.
- fields
- Probability