The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Gibbs states and the set of solutions of random constraint satisfaction problems
Open accessAbstract
An instance of a random constraint satisfaction problem defines a random subset 𝒮 (the set of solutions) of a large product space XN(the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and q-coloring of random regular graphs) and study the uniform measure with support on S. As the number of constraints per variable increases, this measure first decomposes into an exponential number of pure states (“clusters”) and subsequently condensates over the largest such states. Above the condensation point, the mass carried by the n largest states follows a Poisson-Dirichlet process. For typical large instances, the two transitions are sharp. We determine their precise location. Further, we provide a formal definition of each phase transition in terms of different notions of correlation between distinct variables in the problem. The degree of correlation naturally affects the performances of many search/sampling algorithms. Empirical evidence suggests that local Monte Carlo Markov chain strategies are effective up to the clustering phase transition and belief propagation up to the condensation point. Finally, refined message passing techniques (such as survey propagation) may also beat this threshold.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16
Storkey, A. (2004) · neural information processing systems · Cited by 2,085
Gibbs Measures and Phase Transitions
Georgii, H.-O. (2011) · De Gruyter eBooks · doi:10.1515/9783110250329 · Cited by 1,674
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Analytic and Algorithmic Solution of Random Satisfiability Problems
Mézard, M., Parisi, G., & Zecchina, R. (2002) · Science · doi:10.1126/science.1073287 · Cited by 1,071
The Bethe lattice spin glass revisited
Mézard, M., & Parisi, G. (2001) · The European Physical Journal B · doi:10.1007/pl00011099 · Cited by 818
Sharp thresholds of graph properties, and the $k$-sat problem
Friedgut, E., & Jean Bourgain, A. B. (1999) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-99-00305-7 · Cited by 678
Rigorous location of phase transitions in hard optimization problems
Achlioptas, D., Naor, A., & Peres, Y. (2005) · Nature · doi:10.1038/nature03602 · Cited by 279
A mathematical reformulation of Derrida's REM and GREM
Ruelle, D. (1987) · Communications in Mathematical Physics · doi:10.1007/bf01210613 · Cited by 231
Clustering of Solutions in the Random Satisfiability Problem
Mézard, M., Mora, T., & Zecchina, R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.197205 · Cited by 207
Mulet, R., Pagnani, A., Weigt, M., & Zecchina, R. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.268701 · Cited by 191
Threshold values of random K‐SAT from the cavity method
Mertens, S., Mézard, M., & Zecchina, R. (2006) · Random Structures & Algorithms · doi:10.1002/rsa.20090 · Cited by 188
The chromatic number of random graphs
Łuczak, T. (1991) · Combinatorica · doi:10.1007/bf01375472 · Cited by 185
On the solution-space geometry of random constraint satisfaction problems
Achlioptas, D., & Ricci‐Tersenghi, F. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132537 · Cited by 155
Self-citationMossel, E., & Peres, Y. (2003) · The Annals of Applied Probability · doi:10.1214/aoap/1060202828 · Cited by 146
Survey propagation as local equilibrium equations
Braunstein, A., & Zecchina, R. (2004) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2004/06/p06007 · Cited by 137
Cooling-schedule dependence of the dynamics of mean-field glasses
Andrea Montanari, A., & Ricci‐Tersenghi, F. (2004) · Physical Review B · doi:10.1103/physrevb.70.134406 · Cited by 94
Self-citationLandscape of Solutions in Constraint Satisfaction Problems
Mézard, M., Palassini, M., & Rivoire, O. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.200202 · Cited by 77
Krząkała, F., Pagnani, A., & Weigt, M. (2004) · Physical Review E · doi:10.1103/physreve.70.046705 · Cited by 67
Cited by
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Theoretical perspective on the glass transition and amorphous materials
Berthier, L., & Biroli, G. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.587 · Cited by 2,133
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Self-citationDecelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review E · doi:10.1103/physreve.84.066106 · Cited by 747
Self-citationMean-field theory of hard sphere glasses and jamming
Parisi, G., & Zamponi, F. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.789 · Cited by 705
Metadata
- Authors
- Krz̧akała, F., Montanari, A., Ricci-Tersenghi, F., Semerjian, G., & Zdeborová, L.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2007-06-19
- Volume
- 104
- Issue
- 25
- Pages
- 10318-10323
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2168290833
- Cited by
- 546
- References
- 20
- FWCI
- 61.25
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.