Rigid colourings of hypergraphs and contiguity
Peter Ayre, Catherine Greenhill

TL;DR
This paper determines the rigidity threshold for q-colouring k-uniform random hypergraphs, revealing a phase transition in solution space structure that explains algorithmic barriers, and establishes contiguity between models up to the condensation phase.
Contribution
It rigorously identifies the rigidity threshold and the associated geometric phase transition in hypergraph colouring, confirming physics predictions and analyzing model contiguity.
Findings
Above the threshold, most solutions have linearly frozen vertices.
Below the threshold, almost all vertices can be recoloured sequentially.
The random and planted models are contiguous up to the condensation phase.
Abstract
We consider the problem of -colouring a -uniform random hypergraph, where , and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of vertices that are linearly frozen, meaning that they cannot be recoloured by a sequence of colourings that each change the colour of a sublinear number of vertices. When the edge density is below the threshold, we prove that all but a vanishing proportion of the vertices can be recoloured by a sequence of colourings that recolour only one vertex at a time. This change in the geometry of the solution space has been hypothesised to be the cause of the algorithmic barrier faced by naive colouring algorithms. Our calculations verify predictions made by statistical physicists using the non-rigorous cavity method. The traditional model for problems of this…
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Topological and Geometric Data Analysis · Point processes and geometric inequalities
