Derandomizing the Lovasz Local Lemma via log-space statistical tests

07/17/2018
by   David G. Harris, et al.
0

The Lovász Local Lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection B of "bad" events which are mostly independent and have low probability. In its simplest form, it asserts that whenever a bad-event has probability p and affects at most d other bad-events, and e p (d+1) < 1, then a configuration avoiding all B exists. A seminal algorithm of Moser & Tardos (2010) gives randomized algorithms for most constructions based on the LLL. However, deterministic algorithms have lagged behind. Notably, prior deterministic LLL algorithms have required stringent conditions on B; for example, they have required that events in B have low decision-tree complexity or depend on a small number of variables. For this reason, they can only be applied to small fraction of the numerous LLL applications in practice. We describe an alternate deterministic parallel (NC) algorithm for the LLL, based on a general derandomization method of Sivakumar (2002) using log-space statistical tests. The only requirement here is that bad-events should be computable via a finite automaton with poly(d) states. This covers most LLL applications to graph theory and combinatorics. No auxiliary information about the bad-events, including any conditional probability calculations, are required. Additionally, the proof is a straightforward combination of general derandomization results and high-level analysis of the Moser-Tardos algorithm. We illustrate with applications to defective vertex coloring, domatic partition, and independent transversals.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2019

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...
research
08/18/2022

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...
research
08/17/2019

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...
research
12/10/2021

Improved Deterministic (Δ+1)-Coloring in Low-Space MPC

We present a deterministic O(logloglog n)-round low-space Massively Para...
research
09/23/2022

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond

We develop a general deterministic distributed method for locally roundi...
research
03/28/2023

Lower Bounds for Pseudo-Deterministic Counting in a Stream

Many streaming algorithms provide only a high-probability relative appro...
research
11/22/2017

Deterministic parallel algorithms for bilinear objective functions

Many randomized algorithms can be derandomized efficiently using either ...

Please sign up or login with your details

Forgot password? Click here to reset