Finite-size scaling in random $K$-satisfiability problems

Abstract

We provide a comprehensive view of various phase transitions in random $K$-satisfiability problems solved by stochastic-local-search algorithms. In particular, we focus on the finite-size scaling (FSS) exponent, which is mathematically important and practically useful in analyzing finite systems. Using the FSS theory of nonequilibrium absorbing phase transitions, we show that the density of unsatisfied clauses clearly indicates the transition from the solvable (absorbing) phase to the unsolvable (active) phase as varying the noise parameter and the density of constraints. Based on the solution clustering (percolation-type) argument, we conjecture two possible values of the FSS exponent, which are confirmed reasonably well in numerical simulations for $2\le K\le 3$.

5 pages, 3 figures (6 eps files), 1 table; published version

References in corpus (9)

• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• Phase Transitions in the Coloring of Random Graphs
• A Landscape Analysis of Constraint Satisfaction Problems
• Finite-size scaling in complex networks
• Circumspect descent prevails in solving random constraint satisfaction problems
• Behavior of heuristics and state space structure near SAT/UNSAT transition
• Finite size scaling for the core of large random hypergraphs
• Numerical Solution-Space Analysis of Satisfiability Problems
• Constraint optimization and landscapes

Cited by in corpus (1)

• Maximally flexible solutions of a random $K$-satisfiability formula