The Mézard-Parisi formula for diluted Potts models

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20345
Primary Topic
Theoretical and Computational Physics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Mézard-Parisi formula for diluted Potts models

Dmitry Panchenko
arXiv (Cornell University)
Theoretical and Computational Physics
preprint

The Mézard-Parisi formula for diluted Potts models

Dmitry Panchenko
preprint en

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.

arXiv (Cornell University)
Theoretical and Computational Physics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon