Phase transitions in the $q$-coloring of random hypergraphs

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 $K$ variables that must be assigned one out of $q$ 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 ($K=2$) and bicoloring of random hypergraphs ($q=2$), 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 $q$ of the domain of the variables and the arity $K$ of the constraints can be varied at will. Our work provides explicit values and predictions for a number of phase transitions that were discovered in other constraint satisfaction problems but never evaluated before in hypergraph coloring. Among other cases we revisit the hypergraph bicoloring problem ($q=2$) where we find that for $K=3$ and $K=4$ the colorability threshold is not given by the one-step-replica-symmetry-breaking analysis as the latter is unstable towards more levels of replica symmetry breaking. We also unveil and discuss the coexistence of two different 1RSB solutions in the case of $q=2$, $K\ge 4$. Finally we present asymptotic expansions for the density of constraints at which various phase transitions occur, in the limit where $q$ and/or $K$ diverge.

31 pages, 7 figures

References in corpus (10)

• Theoretical perspective on the glass transition and amorphous materials
• Broken Replica Symmetry Bounds in the Mean Field Spin Glass Model
• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• Clustering of solutions in the random satisfiability problem
• Clusters of solutions and replica symmetry breaking in random k-satisfiability
• Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
• Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs
• Statistical and computational phase transitions in spiked tensor estimation
• Reconstruction of Random Colourings
• Reconstruction of colourings without freezing

Cited by in corpus (11)

• Typology of phase transitions in Bayesian inference problems
• Sampling with flows, diffusion and autoregressive neural networks: A spin-glass perspective
• Biased landscapes for random Constraint Satisfaction Problems
• Learning from Survey Propagation: a Neural Network for MAX-E-$3$-SAT
• Random Recursive Hypergraphs
• The asymptotics of the clustering transition for random constraint satisfaction problems
• Counting and Hardness-of-Finding Fixed Points in Cellular Automata on Random Graphs
• Satisfiability Thresholds for Regular Occupation Problems
• Evidence of Replica Symmetry Breaking under the Nishimori conditions in epidemic inference on graphs
• Minority Takeover in Majority Dynamics: Searching for Rare Initializations via the History Passing Algorithm
• Interacting Copies of Random Constraint Satisfaction Problems