Thresholds and expectation thresholds for larger p

preprint2023arXivOpen access

Abstract

Let pcp_\mathrm{c} and qcq_\mathrm{c} be the threshold and the expectation threshold, respectively, of an increasing family F\mathcal{F} of subsets of a finite set XX, and let ll be the size of a largest minimal element of F\mathcal{F}. Recently, Park and Pham proved the Kahn-Kalai conjecture, which says that pc⩽Kqclog⁡2lp_\mathrm{c} \leqslant K q_\mathrm{c} \log_2 l for some universal constant KK. Here we slightly strengthen their result by showing that pc⩽1−e−Kqclog⁡2lp_\mathrm{c} \leqslant 1 - \mathrm{e}^{-K q_\mathrm{c} \log_2 l}. The idea is to apply the Park-Pham Theorem to an appropriate `cloned' family Fk\mathcal{F}_k, reducing the general case (of this and related results) to the case where the individual element probability pp is small.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.