DeepAI AI Chat
Log In Sign Up

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma

by   Sebastian Brandt, et al.
ETH Zurich

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lovász Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved that, under the LLL criterion p2^d < 1, if each random variable affects at most 3 events, the deterministic complexity of the LLL in the LOCAL model is O(d^2 + log^* n). In stark contrast, under the criterion p2^d ≤ 1, there is a randomized lower bound of Ω(loglog n) by Brandt et al. [STOC'16] and a deterministic lower bound of Ω(log n) by Chang, Kopelowitz and Pettie [FOCS'16]. Brandt, Maus and Uitto conjectured that the same behavior holds for the unrestricted setting where each random variable affects arbitrarily many events. We prove their conjecture, by providing an algorithm that solves the LLL in time O(d^2 + log^* n) under the LLL criterion p2^d < 1, which is tight in bounded-degree graphs due to an Ω(log^* n) lower bound by Chung, Pettie and Su [PODC'14]. By the work of Brandt, Maus and Uitto, obtaining such an algorithm can be reduced to proving that all members in a certain family of functions in arbitrarily high dimensions are convex on some specific domain. Unfortunately, an analytical description of these functions is known only for dimension at most 3, which led to the aforementioned restriction of their result. While obtaining those descriptions for functions of (substantially) higher dimension seems out of the reach of current techniques, we show that their convexity can be inferred by combinatorial means.


page 1

page 2

page 3

page 4


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...

The randomized local computation complexity of the Lovász local lemma

The Local Computation Algorithm (LCA) model is a popular model in the fi...

Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness

We study the complexity of optimizing highly smooth convex functions. Fo...

An Automatic Speedup Theorem for Distributed Problems

Recently, Brandt et al. [STOC'16] proved a lower bound for the distribut...

Moser-Tardos Algorithm: Beyond Shearer's Bound

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

Near-optimal Algorithms for Explainable k-Medians and k-Means

We consider the problem of explainable k-medians and k-means introduced ...

Quantum Lovász Local Lemma: Shearer's Bound is Tight

Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and pr...