Random Walks That Find Perfect Objects and the Lovasz Local Lemma

  title={Random Walks That Find Perfect Objects and the Lovasz Local Lemma},
  author={Dimitris Achlioptas and Fotis Iliopoulos},
  journal={2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
We give an algorithmic local lemma by establishing a sufficient condition for the uniform random walk on a directed graph to reach a sink quickly. Our work is inspired by Moser’s entropic method proof of the Lovász Local Lemma (LLL) for satisfiability and completely bypasses the Probabilistic Method formulation of the LLL. In particular, our method works when the underlying state space is entirely unstructured. Similarly to Moser’s argument, the key point is that the inevitability of reaching a… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
35 Citations
7 References
Similar Papers


Publications citing this paper.

60 Citations

Citations per Year
Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…