Sharp thresholds for the random-cluster and Ising models
Benjamin Graham, Geoffrey Grimmett

TL;DR
This paper proves a sharp-threshold theorem for crossing probabilities in the square lattice for models like the random-cluster and Ising models, extending influence theorems without symmetry assumptions.
Contribution
It introduces a new sharp-threshold result for these models, applicable near critical points and with no symmetry constraints.
Findings
Established sharp thresholds for crossing probabilities
Extended influence theorem to non-symmetric measures
Applied results to models near criticality
Abstract
A sharp-threshold theorem is proved for box-crossing probabilities on the square lattice. The models in question are the random-cluster model near the self-dual point , the Ising model with external field, and the colored random-cluster model. The principal technique is an extension of the influence theorem for monotonic probability measures applied to increasing events with no assumption of symmetry.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
