Distributed algorithms for the Lovász local lemma and graph coloring
The Lovász local lemma (LLL), introduced by Erdős and Lovász in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n “bad” events do not happen with non-zero probability, provided that the events have limited dependence. However, the LLL itself does not sugge...
Uloženo v:
| Vydáno v: | Distributed computing Ročník 30; číslo 4; s. 261 - 280 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.08.2017
Springer Nature B.V |
| Témata: | |
| ISSN: | 0178-2770, 1432-0452 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The Lovász local lemma (LLL), introduced by Erdős and Lovász in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of
n
“bad” events do not happen with non-zero probability, provided that the events have limited dependence. However, the LLL itself does not suggest how to find a point avoiding all bad events. Since the works of Alon (Random Struct Algorithms 2(4):367–378,
1991
) and Beck (Random Struct Algorithms 2(4):343–365,
1991
) there has been a sustained effort to find a constructive proof (i.e. an algorithm) for the LLL or weaker versions of it. In a major breakthrough Moser and Tardos (J ACM 57(2):11,
2010
) showed that a point avoiding all bad events can be found efficiently. They also proposed a distributed/parallel version of their algorithm that requires
O
(
log
2
n
)
rounds of communication in a distributed network. In this paper we provide two new distributed algorithms for the LLL that improve on both the efficiency and simplicity of the Moser–Tardos algorithm. For clarity we express our results in terms of the symmetric LLL though both algorithms deal with the asymmetric version as well. Let
p
bound the probability of any bad event and
d
be the maximum degree in the dependency graph of the bad events. When
e
p
d
2
<
1
we give a truly simple LLL algorithm running in
O
(
log
1
/
e
p
d
2
n
)
rounds. Under the weaker condition
e
p
(
d
+
1
)
<
1
, we give a slightly slower algorithm running in
O
(
log
2
d
·
log
1
/
e
p
(
d
+
1
)
n
)
rounds. Furthermore, we give an algorithm that runs in
sublogarithmic
rounds under the condition
p
·
f
(
d
)
<
1
, where
f
(
d
) is an exponential function of
d
. Although the conditions of the LLL are locally verifiable, we prove that any distributed LLL algorithm requires
Ω
(
log
∗
n
)
rounds. In many graph coloring problems the existence of a valid coloring is established by one or more applications of the LLL. Using our LLL algorithms, we give logarithmic-time distributed algorithms for frugal coloring, defective coloring, coloring girth-4 (triangle-free) and girth-5 graphs, edge coloring, and list coloring. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0178-2770 1432-0452 |
| DOI: | 10.1007/s00446-016-0287-6 |