• Corpus ID: 49864507

Derandomizing the Lovasz Local Lemma via log-space statistical tests

@article{Harris2018DerandomizingTL,
  title={Derandomizing the Lovasz Local Lemma via log-space statistical tests},
  author={David G. Harris},
  journal={ArXiv},
  year={2018},
  volume={abs/1807.06672}
}
The Lov\'{a}sz Local Lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection $\mathcal 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 $\mathcal B$ exists. A seminal algorithm of Moser & Tardos (2010) gives randomized… 
Finding independent transversals efficiently
TLDR
An efficient algorithm is given that, given a graph G and a partition V1,…,Vm of its vertex set, finds either an independent transversal, or a subset of vertex classes such that the subgraph of G induced by $\bigcup\nolimits_{\cal B}$ has a small dominating set.
Algorithms for weighted independent transversals and strong colouring
TLDR
A randomized version of this algorithm that is much more widely applicable is developed, and its use is demonstrated by giving efficient algorithms for two problems concerning the strong chromatic number of graphs.
N ov 2 01 8 Finding Independent Transversals Efficiently
We give an efficient algorithm that, given a graph G and a partition V1, . . . , Vm of its vertex set, finds either an independent transversal (an independent set {v1, . . . , vm} in G such that vi ∈

References

SHOWING 1-10 OF 13 REFERENCES
Sublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy
TLDR
It is proved that any o(\log n)-round randomized distributed algorithm for any LCL problem on bounded degree graphs can be automatically sped up to run in 2^{O(\sqrt{\log\log n})}$ rounds.
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma
TLDR
This work gives a new algorithm to generate a probability space which can fool a given set of neighborhoods, and uses this for an NC2 algorithm for defective vertex coloring, which works for arbitrary degree graphs.
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs
TLDR
A new parallel algorithm is given that works under essentially the same conditions as the original algorithm of Moser and Tardos but uses only a single MIS computation, thus running in O(log2 n) time on an EREW PRAM.
Deterministic Parallel Algorithms for Bilinear Objective Functions
TLDR
This work extends and generalizes a technique of Luby for efficiently handling bilinear objective functions and leads to large reduction in processor complexity for a number of derandomization algorithms based on automata-fooling, including set discrepancy and the Johnson–Lindenstrauss Lemma.
Algorithmic derandomization via complexity theory
  • D. Sivakumar
  • Computer Science
    Proceedings 17th IEEE Annual Conference on Computational Complexity
  • 2002
We point out how the methods of Nisan [Nis90, Nis92], originally developed for derandomizing space-bounded computations, may be applied to obtain polynomial-time and NC derandomizations of several
A constructive proof of the general lovász local lemma
TLDR
This article improves upon recent findings so as to provide a method for making almost all known applications of the general Local Lemma algorithmic.
Solving Some Discrepancy Problems in NC
TLDR
Other problems whose NC solution is improved are lattice approximation, e-approximations of range spaces of bounded VC-exponent, sampling in geometric configuration spaces, approximation of integer linear programs, and edge coloring of graphs.
Approximating the domatic number
TLDR
It is shown that for every ǫ > 0, a (1−ǫ) lnn-approximation implies that NP ⊆ DTIME(n log ), which makes domatic number the first natural maximization problem that is provably approximable to within polylogarithmic factors but no better.
The linear arboricity of graphs
AbstractAlinear forest is a forest in which each connected component is a path. Thelinear arboricity la(G) of a graphG is the minimum number of linear forests whose union is the set of all edges ofG.
On complete subgraphs of r-chromatic graphs
TLDR
It is proved that G contains at least t^3 triangles but does not have to contain more than 4t^3 of them and lower bounds for s are given such thatG contains a complete 3-partite graph with s vertices in each class.
...
1
2
...