REVIEW 1 cited by
A Proof of the Kahn-Kalai Conjecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Proving the ``expectation-threshold'' conjecture of Kahn and Kalai, we show that for any increasing property $\mathcal{F}$ on a finite set $X$, $$p_c(\mathcal{F})=O(q(\mathcal{F})\log \ell(\mathcal{F})),$$ where $p_c(\mathcal{F})$ and $q(\mathcal{F})$ are the threshold and ``expectation threshold'' of $\mathcal{F}$, and $\ell(\mathcal{F})$ is the maximum of $2$ and the maximum size of a minimal member of $\mathcal{F}$.
Forward citations
Cited by 1 Pith paper
-
A random walk among random graphs
These lecture notes provide a pedagogical tour of random walk and random graph theory, covering standard results without claiming new research advances.
Discussion (0). Continue with ORCID to comment.