Random Walks That Find Perfect Objects and the Lovasz Local Lemma

@inproceedings{Achlioptas2014RandomWT,
  title={Random Walks That Find Perfect Objects and the Lovasz Local Lemma},
  author={Dimitris Achlioptas and F. Iliopoulos},
  booktitle={FOCS},
  year={2014}
}
  • Dimitris Achlioptas, F. Iliopoulos
  • Published in FOCS 2014
  • Mathematics, 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 Lovasz 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 algorithmic progress is… CONTINUE READING
    9 Citations

    Topics from this paper

    Compress\~ao de Entropia e Colora\c{c}\~oes Leg\'itimas em Planos Projetivos
    • Highly Influenced
    • PDF
    Algorithmic and enumerative aspects of the moser-tardos distribution
    • 4
    • Highly Influenced
    Color-blind index in graphs of very low degree
    • 1
    • PDF
    Rainbow Hamilton cycles and lopsidependency
    • 2
    • PDF
    The Local Cut Lemma
    • 21
    • PDF
    Random Walks That Find Perfect Objects and the Lovasz Local Lemma
    • 63
    • PDF

    References

    SHOWING 1-10 OF 17 REFERENCES
    Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs
    • 14
    • PDF
    A constructive algorithm for the Lovász Local Lemma on permutations
    • 51
    • PDF
    The Lovász Local Lemma - A Survey
    • 24
    The Moser-Tardos Framework with Partial Resampling
    • D. G. Harris, A. Srinivasan
    • Mathematics, Computer Science
    • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
    • 2013
    • 53
    • PDF
    Quest for Negative Dependency Graphs
    • 22
    • PDF
    Rainbow Hamilton Cycles in Uniform Hypergraphs
    • 23
    • PDF
    Highly nonrepetitive sequences: Winning strategies from the local lemma
    • Wesley Pegden
    • Mathematics, Computer Science
    • Random Struct. Algorithms
    • 2011
    • 29
    • PDF
    A constructive proof of the general lovász local lemma
    • 442
    • PDF
    New Constructive Aspects of the Lovasz Local Lemma
    • 7