Phase transitions in the $q$-coloring of random hypergraphs
Marylou Gabri\'e, Varsha Dani, Guilhem Semerjian, Lenka Zdeborov\'a

TL;DR
This paper investigates the solution structure and phase transitions in random hypergraph coloring problems, providing explicit predictions and revealing complex behaviors like multiple RSB solutions and thresholds for various parameters.
Contribution
It offers the first detailed analysis of phase transitions in hypergraph coloring, including explicit thresholds and the discovery of multiple 1RSB solutions.
Findings
Colorability thresholds for K=3 and K=4 hypergraph coloring are not given by 1RSB analysis.
Existence of coexistence of two different 1RSB solutions for q=2, K≥4.
Asymptotic expansions for phase transition densities as q and/or K diverge.
Abstract
We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where each constraint includes variables that must be assigned one out of colors in such a way that there are no monochromatic constraints, i.e. there are at least two distinct colors in the set of variables belonging to every constraint. This problem generalizes naturally coloring of random graphs () and bicoloring of random hypergraphs (), both of which were extensively studied in past works. The study of random hypergraph coloring gives us access to a case where both the size of the domain of the variables and the arity of the constraints can be varied at will. Our work provides explicit values and predictions for a number of phase…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
