On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited
Abstract
The purpose of this expository note is to give the proof of a theorem of Bourgain with some additional details and updated notation. The theorem first appeared as an appendix to the breakthrough paper by Friedgut, Sharp Thresholds of graph properties and the k-SAT Problem. Throughout, we use notation and definitions akin to those in O'Donnell's book, Analysis of Boolean Functions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.