Journal of Statistical Physics

, Volume 130, Issue 2, pp 251–293

On the Freezing of Variables in Random Constraint Satisfaction Problems

  1. 1.LPTENS, Unité Mixte de Recherche (UMR 8549) du CNRS et de l’ENS associée à l’Université Pierre et Marie CurieParis Cedex 05France
Article

DOI: 10.1007/s10955-007-9417-7

Cite this article as:
Semerjian, G. J Stat Phys (2008) 130: 251. doi:10.1007/s10955-007-9417-7

Abstract

The set of solutions of random constraint satisfaction problems (zero energy groundstates of mean-field diluted spin glasses) undergoes several structural phase transitions as the amount of constraints is increased. This set first breaks down into a large number of well separated clusters. At the freezing transition, which is in general distinct from the clustering one, some variables (spins) take the same value in all solutions of a given cluster. In this paper we introduce and study a message passing procedure that allows to compute, for generic constraint satisfaction problems, the sizes of the rearrangements induced in response to the modification of a variable. These sizes diverge at the freezing transition, with a critical behavior which is also investigated in details. We apply the generic formalism in particular to the random satisfiability of boolean formulas and to the coloring of random graphs. The computation is first performed in random tree ensembles, for which we underline a connection with percolation models and with the reconstruction problem of information theory. The validity of these results for the original random ensembles is then discussed in the framework of the cavity method.

Keywords

Random constraint satisfaction problemsFreezing transitionCavity method
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2007