Proof of the Van den Berg–Kesten Conjecture

2000/01/01 by DAVID REIMER · 6 citations
Computer Science · Economics, Econometrics and Finance · #Advanced Algebra and Logic #Rough Sets and Fuzzy Logic #Game Theory and Voting Systems

paper · doi:10.1017/s0963548399004113

openalex publication_date 2000/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/04/04

Abstract

We prove the following conjecture of J. van den Berg and H. Kesten. For any events [Ascr ] and [Bscr ] in a product probability space, Prob([Ascr ]□[Bscr ]) [les ] Prob([Ascr ])Prob([Bscr ]), where [Ascr ]□[Bscr ] is the event that [Ascr ] and [Bscr ] occur ‘disjointly’.

Cited by

• Some People Have All the Luck
• Arm exponents in high dimensional percolation
• Pivotal, cluster, and interface measures for critical planar percolation
• Quantitative noise sensitivity and exceptional times for percolation
• Convergence of limit shapes for 2D near-critical first-passage percolation
• Van den Berg–Kesten inequality [wikipedia]