What makes a phase transition? Analysis of the random satisfiability problem
K. A. Zweig, G. Palla, T. Vicsek

TL;DR
This paper investigates phase transitions in random k-SAT problems, revealing that the number of solutions follows a lognormal distribution and questioning whether the known sharp thresholds truly represent phase transitions.
Contribution
It provides numerical evidence that the number of solutions is lognormally distributed and challenges the association between phase transitions and problem hardness in random k-SAT.
Findings
Number of solutions follows a lognormal distribution.
Counting solutions does not exhibit phase transition-like behavior.
Sharp threshold may not correspond to a true phase transition.
Abstract
In the last 30 years it was found that many combinatorial systems undergo phase transitions. One of the most important examples of these can be found among the random k-satisfiability problems (often referred to as k-SAT), asking whether there exists an assignment of Boolean values satisfying a Boolean formula composed of clauses with k random variables each. The random 3-SAT problem is reported to show various phase transitions at different critical values of the ratio of the number of clauses to the number of variables. The most famous of these occurs when the probability of finding a satisfiable instance suddenly drops from 1 to 0. This transition is associated with a rise in the hardness of the problem, but until now the correlation between any of the proposed phase transitions and the hardness is not totally clear. In this paper we will first show numerically that the number of…
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.
