222 citations · 495 across the 7 of their papers we have counts for
13 papers
Message passing algorithms for non-linear nodes and data compression
S. Ciliberti, M. Mezard, R. Zecchina
The use of parity-check gates in information theory has proved to be very efficient. In particular, error correcting codes based on parity checks over low-density graphs show excel…
Clustering of solutions in the random satisfiability problem
M. Mezard, T. Mora, R. Zecchina
Using elementary rigorous methods we prove the existence of a clustered phase in the random -SAT problem, for . In this phase the solutions are grouped into clusters wh…
Message passing in random satisfiability problems
Marc Mezard
This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generaliz…
Threshold values of Random K-SAT from the cavity method
Stephan Mertens, Marc Mezard, Riccardo Zecchina
Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random -s…
Survey propagation: an algorithm for satisfiability
A. Braunstein, M. Mezard, R. Zecchina
We study the satisfiability of randomly generated formulas formed by clauses of exactly literals over Boolean variables. For a given value of the problem is known t…
Alternative solutions to diluted p-spin models and XORSAT problems
M. Mezard, F. Ricci-Tersenghi, R. Zecchina
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 theoret…