Random subcubes as a toy model for constraint satisfaction problems

TL;DR

This paper introduces an exactly solvable random-subcube model that mimics the structure and phase transitions of complex constraint satisfaction problems like k-satisfiability and k-coloring, providing insights into their solution space and glassy dynamics.

Contribution

The authors develop a new toy model that captures the solution space structure and phase transitions of hard CSPs, enabling analytical study of their properties.

Findings

Model reproduces the solution space structure of CSPs

Identifies phase transitions similar to those in k-satisfiability and k-coloring

Generalizes to a continuous energy landscape for glassy dynamics

Abstract

We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-coloring problems, and undergoes the same phase transitions as these problems. The comparison becomes quantitative in the large-k limit. Distance properties, as well the x-satisfiability threshold, are studied. The model is also generalized to define a continuous energy landscape useful for studying several aspects of glassy dynamics.