58 citations · 184 across the 6 of their papers we have counts for
6 papers
A Lattice Model for Colloidal Gels and Glasses
Florent Krzakala, Marco Tarzia, Lenka Zdeborová
We study a lattice model of attractive colloids. It is exactly solvable on sparse random graphs. As the pressure and temperature are varied it reproduces many characteristic phenom…
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
John Ardelius, Lenka Zdeborová
We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters correspo…
Locked constraint satisfaction problems
Lenka Zdeborová, Marc Mézard
We introduce and study the random "locked" constraint satisfaction problems. When increasing the density of constraints, they display a broad "clustered" phase in which the space o…
Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems
Florent Krzakala, Lenka Zdeborová
We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method of the…
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…
A Hike in the Phases of the 1-in-3 Satisfiability
Elitza Maneva, Talya Meltzer, Jack Raymond +2
We summarise our results for the random --1-in-3 satisfiability problem, where is a probability of negation of the variable. We employ both rigorous and heuristic methods to…