Short proofs for generalizations of the Lovász Local Lemma: Shearer's condition and cluster expansion
Nicholas J. A. Harvey, J. Vondrák
Abstract
Open-access reader
Nicholas J. A. Harvey, J. Vondrák
Abstract
Open-access reader
The Lovász Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events. Over the years, more general conditions have been discovered under which the conclusion of the lemma continues to hold. In this note we provide short proofs of two of those more general results: Shearer's lemma and the cluster expansion lemma, in their "lopsided" form. We conclude by using the cluster expansion lemma to prove that the symmetric form of the local lemma holds with probabilities bounded by $1/ed$, rather than the bound $1/e(d+1)$ required by the traditional proofs.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Lovász Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events. Over the years, more general conditions have been discovered under which the conclusion of the lemma continues to hold. In this note we provide short proofs of two of those more general results: Shearer's lemma and the cluster expansion lemma, in their "lopsided" form. We conclude by using the cluster expansion lemma to prove that the symmetric form of the local lemma holds with probabilities bounded by $1/ed$, rather than the bound $1/e(d+1)$ required by the traditional proofs.
Key concepts: Lemma (botany), Mathematical proof, Mathematics, Cluster expansion, Bounded function, Cluster (spacecraft), Combinatorics, Discrete mathematics