222 citations · 579 across the 8 of their papers we have counts for
9 papers
Signatures of irreversibility in microscopic models of flocking
Federica Ferretti, Simon Grosse-Holz, Caroline Holmes +4
Flocking in is a genuine non-equilibrium phenomenon for which irreversibility is an essential ingredient. We study a class of minimal flocking models whose only source of irr…
Constraint satisfaction problems and neural networks: a statistical physics perspective
Marc Mezard, Thierry Mora
A new field of research is rapidly expanding at the crossroad between statistical physics, information theory and combinatorial optimization. In particular, the use of cutting edge…
Random subcubes as a toy model for constraint satisfaction problems
Thierry Mora, Lenka Zdeborova
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s…
Statistical mechanics of error exponents for error-correcting codes
Thierry Mora, Olivier Rivoire
Error exponents characterize the exponential decay, when increasing message length, of the probability of error of many error-correcting codes. To tackle the long standing problem…
Error Exponents of Low-Density Parity-Check Codes on the Binary Erasure Channel
Thierry Mora, Olivier Rivoire
We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method from s…
Pairs of SAT Assignment in Random Boolean Formulae
Hervé Daudé, Marc Mezard, Thierry Mora +1
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments dif…