The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The scaling window of the 2‐SAT transition
Open accessAbstract
We consider the random 2‐satisfiability (2‐SAT) problem, in which each instance is a formula that is the conjunction of m clauses of the form x∨y, chosen uniformly at random from among all 2‐clauses on n Boolean variables and their negations. As m and n tend to infinity in the ratio m/n→α, the problem is known to have a phase transition at αc=1, below which the probability that the formula is satisfiable tends to one and above which it tends to zero. We determine the finite‐size scaling about this transition, namely the scaling of the maximal window W(n, δ)=(α−(n,δ), α+(n,δ)) such that the probability of satisfiability is greater than 1−δ for α<α−and is less than δ for α>α+. We show that W(n,δ)=(1−Θ(n−1/3), 1+Θ(n−1/3)), where the constants implicit in Θ depend on δ. We also determine the rates at which the probability of satisfiability approaches one and zero at the boundaries of the window. Namely, for m=(1+ε)n, where ε may depend on n as long as |ε| is sufficiently small and |ε|n1/3 is sufficiently large, we show that the probability of satisfiability decays like exp(−Θ(n ε 3)) above the window, and goes to one like 1−Θ(n−1|ε|−3 below the window. We prove these results by defining an order parameter for the transition and establishing its scaling behavior in n both inside and outside the window. Using this order parameter, we prove that the 2‐SAT phase transition is continuous with an order parameter critical exponent of 1. We also determine the values of two other critical exponents, showing that the exponents of 2‐SAT are identical to those of the random graph. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 201–256 2001
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Cited by
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
RandomK-satisfiability problem: From an analytic solution to an efficient algorithm
Mézard, M., & Zecchina, R. (2002) · Physical Review E · doi:10.1103/physreve.66.056126 · Cited by 448
Metadata
- Authors
- Bollobás, B., Borgs, C., Chayes, J. T., Kim, J. H., & Wilson, D. B.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 2001-04-18
- Volume
- 18
- Issue
- 3
- Pages
- 201-256
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2006424894
- Cited by
- 206
- References
- 2
- FWCI
- 24.78
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The scaling window of the 2‐SAT transition. https://app.cochat.ai/papers/10.1002/rsa.1006
- The paper
- Bollobás, B., Borgs, C., Chayes, J. T., Kim, J. H., & Wilson, D. B. (2001). The scaling window of the 2‐SAT transition. Random Structures & Algorithms. https://doi.org/10.1002/rsa.1006
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.