The Asymptotics of the Clustering Transition for Random Constraint Satisfaction Problems
- 24 October 2020
- journal article
- research article
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 181 (5) , 1490-1522
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (ANR- 17-CE23-0023-01)
This publication has 33 references indexed in Scilit:
- Reconstruction and Clustering in Random Constraint Satisfaction ProblemsSIAM Journal on Discrete Mathematics, 2011
- Clusters of solutions and replica symmetry breaking in random k-satisfiabilityJournal of Statistical Mechanics: Theory and Experiment, 2008
- Entropy landscape and non-Gibbs solutions in constraint satisfaction problemsPhysical Review E, 2008
- Phase transitions in the coloring of random graphsPhysical Review E, 2007
- Gibbs states and the set of solutions of random constraint satisfaction problemsProceedings of the National Academy of Sciences, 2007
- Survey propagation: An algorithm for satisfiabilityRandom Structures & Algorithms, 2005
- A second threshold for the hard‐core model on a Bethe latticeRandom Structures & Algorithms, 2004
- Information flow on treesThe Annals of Applied Probability, 2003
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- 2+p-SAT: Relation of typical-case complexity to the nature of the phase transitionRandom Structures & Algorithms, 1999