Statistical physics of inference: Thresholds and algorithms

L Zdeborová, F Krzakala - Advances in Physics, 2016 - Taylor & Francis
Many questions of fundamental interest in today's science can be formulated as inference
problems: some partial, or noisy, observations are performed over a set of variables and the …

Random -satisfiability problem: From an analytic solution to an efficient algorithm

M Mézard, R Zecchina - Physical Review E, 2002 - APS
We study the problem of satisfiability of randomly chosen clauses, each with K Boolean
variables. Using the cavity method at zero temperature, we find the phase diagram for the K …

Extremal optimization

S Boettcher - New optimization algorithms in physics, 2004 - Wiley Online Library
Physical processes have inspired many optimization heuristics. Most famously, variants of
simulated annealing and genetic algorithms are widely used tools for the exploration of …

Threshold values of random K‐SAT from the cavity method

S Mertens, M Mézard… - Random Structures & …, 2006 - Wiley Online Library
Using the cavity equations of Mézard, Parisi, and Zecchina Science 297 (2002), 812;
Mézard and Zecchina, Phys Rev E 66 (2002), 056126 we derive the various threshold …

Two Solutions to Diluted p-Spin Models and XORSAT Problems

M Mézard, F Ricci-Tersenghi, R Zecchina - Journal of Statistical Physics, 2003 - Springer
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 …

Ferromagnetic ordering in graphs with arbitrary degree distribution

M Leone, A Vázquez, A Vespignani… - The European Physical …, 2002 - Springer
We present a detailed study of the phase diagram of the Ising model in random graphs with
arbitrary degree distribution. By using the replica method we compute exactly the value of …

Statistical mechanics methods and phase transitions in optimization problems

OC Martin, R Monasson, R Zecchina - Theoretical computer science, 2001 - Elsevier
Recently, it has been recognized that phase transitions play an important role in the
probabilistic analysis of combinatorial optimization problems. However, there are in fact …

Coloring random graphs

R Mulet, A Pagnani, M Weigt, R Zecchina - Physical review letters, 2002 - APS
We study the graph coloring problem over random graphs of finite average connectivity c.
Given a number q of available colors, we find that graphs with low connectivity admit almost …

Replica bounds for optimization problems and diluted spin systems

S Franz, M Leone - Journal of Statistical Physics, 2003 - Springer
In this paper we generalize to the case of diluted spin models and random combinatorial
optimization problems a technique recently introduced by Guerra (cond-mat/0205123) to …

[BOOK][B] Granular physics

A Mehta - 2007 - books.google.com
The field of granular physics has burgeoned since its development in the late 1980s, when
physicists first began to use statistical mechanics to study granular media. They are …