Walksat stalls well below the satisfiability threshold

Partly on the basis of heuristic arguments from physics it has been suggested that the performance of certain types of algorithms on random $k$-SAT formulas is linked to phase transitions that affect the geometry of the set of satisfying assignments. But beyond intuition there has been scant rigorous evidence that “practical” algorithms are affected by these phase transitions. In this paper we prove that \walksat, a popular randomised satisfiability algorithm, fails on random $k$-SAT formulas not very far above clause/variable density where the set of satisfying assignments shatters into tiny, well-separated clusters. Specifically, we prove \walksat\ is ineffective with high probability if $m\mathrm{/}n>c{2}^k{\ln }^{2}k\mathrm{/}k$, where $m$ is the number of clauses, $n$ is the number of variables and $c>0$ is an absolute constant. By comparison, \walksat\ is known to find satisfying assignments in linear time \whp\ if $m\mathrm{/}n<c^{\mathrm{\prime }}{2}^k\mathrm{/}k$ for another constant $c^{\mathrm{\prime }}>0$ [Coja-Oghlan and Frieze, SIAM J.
Computing 2014].