An interactive version of the Lovász local lemma

by   Lefteris Kirousis, et al.

Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events, each depending on a subset of the variables of at most k elements, called the scope of the event. Assume that the probability of a variable belonging to the scope of an occurring event is bounded by q. We prove that if ekq ≤ 1 then there exists at least one assignment to the variables for which none of the events occurs. Examples are given where the criterion ekq ≤ 1 is applicable, whereas that of the classical version of the Lovász local lemma is not. The proof of the result is through an interactive, private-coin implementation of the algorithm by Moser. The original implementation, which yields the classical result, finds efficiently, but probabilistically, an assignment to the events that avoids all undesirable events. Interestingly, the interactive implementation given in this work does not constitute an efficient, even if probabilistic, algorithm to find an assignment as desired under the weaker assumption ekq ≤ 1. We can only conclude that under the hypothesis that ekq ≤ 1, the interactive protocol will produce an assignment as desired within n rounds, with probability high with respect to n; however, the provers' choices remain non-deterministic. Plausibly finding such an assignment is inherently hard, as the situation is reminiscent, in a probabilistic framework, of problems complete for syntactic subclasses of TFNP.


page 1

page 2

page 3

page 4


An interactive version of Lovász local lemma: Arthur and Merlin implement Moser's algorithm

Assume we are given (finitely many) mutually independent variables and (...

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovasz Local Lemma

The Lovász Local Lemma (LLL) says that, given a set of bad events that d...

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring

The Lovász Local Lemma is a classic result in probability theory that is...

Variable Version Lovász Local Lemma: Beyond Shearer's Bound

A tight criterion under which the abstract version Lovász Local Lemma (a...

On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy

In 1991, Papadimitriou and Yannakakis gave a reduction implying the -h...

Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel

The Lovasz Local Lemma (LLL) is a keystone principle in probability theo...

Moser-Tardos Algorithm: Beyond Shearer's Bound

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos develop...

Please sign up or login with your details

Forgot password? Click here to reset