Geometrical organization of solutions to random linear Boolean equations

  title={Geometrical organization of solutions to random linear Boolean equations},
  author={Thierry Mora and Marc M{\'e}zard},
The random XORSAT problem deals with large random linear systems of Boolean variables. The difficulty of such problems is controlled by the ratio of number of equations to number of variables. It is known that in some range of values of this parameter, the space of solutions breaks into many disconnected clusters. Here we study precisely the corresponding geometrical organization. In particular, the distribution of distances between these clusters is computed by the cavity method. This allows… Expand
On the Freezing of Variables in Random Constraint Satisfaction Problems
This paper introduces 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, with a critical behavior at the freezing transition. Expand
Constraint satisfaction problems with isolated solutions are hard
The phase diagram and the algorithmic hardness of the random 'locked' constraint satisfaction problems are studied, and it is suggested that the easy/hard transition in the locked problems coincides with the clustering transition. Expand
Random Subcubes as a Toy Model for Constraint Satisfaction Problems
This work presents an exactly solvable random-subcube model that 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. Expand
On the thresholds in linear and nonlinear Boolean equations
We introduce a generalized XORSAT model, named as Massive Algebraic System (Hereafter abbreviated as MAS) consisting of linear and nonlinear Boolean equations. Through adjusting the proportion ofExpand
Statistical mechanics of maximal independent sets.
This paper uses cavity method of statistical physics and Monte Carlo simulations to study the corresponding constraint satisfaction problem on random graphs, and obtains the entropy of maximal independent sets within the replica symmetric and one-step replica symmetry breaking frameworks. Expand
Statistical Physics of Hard Optimization Problems
A new class of problems is introduced which is named "locked" constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability. Expand
Typical rank of coin-toss power-law random matrices over GF(2)
Random linear systems over the Galois Field modulo 2 have an interest in connection with problems ranging from computational optimization to complex networks. They are often approached using randomExpand
Threshold phenomena in random constraint satisfaction problems
Despite much work over the previous decade, the Satisfiability Threshold Conjecture remains open. Random k-SAT, for constant k ≥ 3, is just one family of a large number of constraint satisfactionExpand
Entropy landscape of solutions in the binary perceptron problem
The statistical picture of the solution space for a binary perceptron and the geometrical organization is elucidated by the entropy landscape from a reference configuration and of solution-pairs separated by a given Hamming distance in the solutions space. Expand
Inside the clustering threshold for random linear equations
It is proved that in a random $r$-uniform hypergraph with edge-density above the k-core threshold, every vertex not in the $k$-core can be removed by a sequence of vertex-deletions in which the deleted vertex has degree less than $k; this is part of a general clustering phenomenon which is hypothesized to arise in most of the commonly studied models of random constraint satisfaction problems. Expand


Pairs of SAT Assignments and Clustering in Random Boolean Formulae
We investigate geometrical properties of the random K-satisfiability problem. For large enough K, we prove that there exists a region of clause density, below the satisfiability threshold, where SATExpand
Random K-satisfiability problem: from an analytic solution to an efficient algorithm.
  • M. Mézard, R. Zecchina
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
The fundamental order parameter introduced in the cavity method, which consists of surveys of local magnetic fields in the various possible states of the system, can be computed for one given sample. Expand
Simplest random K-satisfiability problem
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of gammaN random boolean constraints which are to be satisfied simultaneously by NExpand
Analytic and Algorithmic Solution of Random Satisfiability Problems
A class of optimization algorithms that can deal with the proliferation of metastable states are introduced; one such algorithm has been tested successfully on the largest existing benchmark of K-satisfiability. Expand
Clustering of solutions in the random satisfiability problem
Using elementary rigorous methods it is proved the existence of a clustered phase in the random K-SAT problem, for K > or = 8, which gives a rigorous confirmation to one of its main building blocks. Expand
A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods
A dynamical transition is identified for the behavior of PRW algorithm on randomly drawn SAT instances where, as the ratio of clauses to variables is increased, the scaling of the solving time changes from being linear to exponential in the input size. Expand
Coloring random graphs
It is found that graphs with low connectivity admit almost always a proper coloring, whereas graphs with high connectivity are uncolorable, and there exists a clustering phase c below c(q) in which ground states spontaneously divide into an exponential number of clusters. Expand
The intractability of computing the minimum distance of a code
  • A. Vardy
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1997
It is shown that the problem of computing the minimum distance of a binary linear code is NP-hard, and the corresponding decision problem is NP-complete. This result constitutes a proof of theExpand
Sharp thresholds of graph properties, and the -sat problem
Consider G(n, p) to be the probability space of random graphs on n vertices with edge probability p. We will be considering subsets of this space defined by monotone graph properties. A monotoneExpand
Two Solutions to Diluted p-Spin Models and XORSAT Problems
We derive analytical solutions for p-spin models with finite connectivity at zero temperature. These models are the statistical mechanics equivalent of p-XORSAT problems in theoretical computerExpand