Thresholds and Expectation Thresholds
From MaRDI portal
Publication:3438145
DOI10.1017/S0963548307008474zbMath1118.05093arXivmath/0603218OpenAlexW1991001643MaRDI QIDQ3438145
Publication date: 15 May 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603218
Related Items (34)
Biased halfspaces, noise sensitivity, and local Chernoff inequalities ⋮ Boolean functions: influence, threshold and noise ⋮ Sunflowers: from soil to oil ⋮ On spanning structures in random hypergraphs ⋮ Note on a problem of M. Talagrand ⋮ Around two theorems and a lemma by Lucio Russo ⋮ On a problem of M. Talagrand ⋮ A proof of the Kahn–Kalai conjecture ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ Spanning structures and universality in sparse hypergraphs ⋮ Isoperimetric stability in lattices ⋮ A stability result for the cube edge isoperimetric inequality ⋮ Down‐set thresholds ⋮ The Park-Pham theorem with optimal convergence rate ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems ⋮ Rainbow powers of a Hamilton cycle in Gn,p ⋮ On a biased edge isoperimetric inequality for the discrete cube ⋮ Almost Isoperimetric Subsets of the Discrete Cube ⋮ Thresholds and expectation-thresholds of monotone properties with small minterms ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Thresholds versus fractional expectation-thresholds ⋮ On the structure of subsets of the discrete cube with small edge boundary ⋮ The threshold for combs in random graphs ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Juntas in theℓ1-grid and Lipschitz maps between discrete tori ⋮ On the union of intersecting families ⋮ On Erdős–Ko–Rado for random hypergraphs I ⋮ Variable Influences in Conjunctive Normal Forms ⋮ Optimal threshold for a random graph to be 2-universal ⋮ The threshold for the square of a Hamilton cycle ⋮ Spanning trees in random graphs ⋮ Concentration on the Boolean hypercube via pathwise stochastic analysis ⋮ Hitting times for Shamir’s problem
This page was built for publication: Thresholds and Expectation Thresholds
