The DOI matches its Crossref record.
Every monotone graph property has a sharp threshold
Open accessAbstract
In their seminal work which initiated random graph theory Erdös and Rényi discovered that many graph properties have sharp thresholds as the number of vertices tends to infinity. We prove a conjecture of Linial that every monotone graph property has a sharp threshold. This follows from the following theorem. Let V n ( p ) = { 0 , 1 } n denote the Hamming space endowed with the probability measure μ p defined by μ p ( ϵ 1 , ϵ 2 , … , ϵ n ) = p k ⋅ ( 1 − p ) n − k , where k = ϵ 1 + ϵ 2 + ⋯ + ϵ n . Let A be a monotone subset of V n . We say that A is symmetric if there is a transitive permutation group Γ on { 1 , 2 , … , n } such that A is invariant under Γ . Theorem. For every symmetric monotone A , if μ p ( A ) > ϵ then μ q ( A ) > 1 − ϵ for q = p + c 1 log ( 1 / 2 ϵ ) / log n . ( c 1 is an absolute constant.)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Khot, S., Kindler, G., Mossel, E., & O’Donnell, R. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447372 · Cited by 578
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Noise stability of functions with low influences: Invariance and optimality
Mossel, E., O’Donnell, R., & Oleszkiewicz, K. (2010) · Annals of Mathematics · doi:10.4007/annals.2010.171.295 · Cited by 288
Polynomial simulations of decohered quantum computers
Aharonov, D., & Ben-Or, M. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548463 · Cited by 41
Metadata
- Authors
- Friedgut, E., & Kalai, G.
- Venue
- Proceedings of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1996
- Volume
- 124
- Issue
- 10
- Pages
- 2993-3002
- ISSN
- 0002-9939 (ISSN-L)
- 1088-6826
- OpenAlex
- W1529556207
- Cited by
- 412
- References
- 0
- FWCI
- 9.21
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Every monotone graph property has a sharp threshold. https://app.cochat.ai/papers/10.1090/s0002-9939-96-03732-x
- The paper
- Friedgut, E., & Kalai, G. (1996). Every monotone graph property has a sharp threshold. Proceedings of the American Mathematical Society. https://doi.org/10.1090/s0002-9939-96-03732-x
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.