On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited
Probability
2013-02-07 v2 Combinatorics
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, \emph{Sharp Thresholds of graph properties and the -SAT Problem}. Throughout, we use notation and definitions akin to those in O'Donnell's book, \emph{Analysis of Boolean Functions}.
Keywords
Cite
@article{arxiv.1302.1162,
title = {On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited},
author = {Deepak Bal},
journal= {arXiv preprint arXiv:1302.1162},
year = {2013}
}
Comments
10 pages