200 likes | 502 Views
A Sharper Local Lemma with Improved Applications. Kashyap Kolikapa, Mario Szegedy, Yixin Xu Rutgers University APPROX&RANDOM 2012. Introduction: Lovasz Local Lemma. Independent case: . A set of bad events to avoid: . is independent of.
E N D
A Sharper Local Lemma with Improved Applications Kashyap Kolikapa, Mario Szegedy, Yixin Xu Rutgers University APPROX&RANDOM 2012
Introduction: Lovasz Local Lemma Independent case: A set of bad events to avoid: is independent of General case: Lovasz Local Lemma: (symmetric version) Dependency graph
Introduction: Lovasz Local Lemma Independent case: A set of bad events to avoid: is independent of General case: Dependency graph Asymmetric Version(ErdősandLovász, [EL75]).
Classical Application of LLL A set of bad events to avoid: Variable Framework: Dependency graph: iff Example: Remark: Given a k-SAT instance, each clause shares variables with < other clauses then the instance is satisfiable.
Cons of LLL LLL is not tight! LLL: Union bound: Is there a tight condition for ? Yes, Shearer’s condition! Roughly speaking, independent sets of dependency graph give all information!
Shearer’s condition Shearer’s polynomial: Shearer’s condition: a set of events to avoid, G the dependency graph:
Cons of LLL LLL is not tight! LLL: Union bound: Shearer’s condition:
Motivation • Lovasz Local Lemma • Sufficient condition, not tight • Local information • Shearer’s condition • Iff condition, tight • Global information, NP-hard to compute • Is there a continuum between LLL and Shearer’s condition?
Clique Lovasz Local Lemma LLL: CLLL:
Comparison between LLL and CLLL • CLLL always give better bounds than LLL • LLL is a special case that cliques are single edges • Example: max degree d graph • LLL: • CLLL:
Reason behind LLL and CLLL LLL: CLLL: Graph Decomposition: Given an undirected graph G, a set of induced subgraphs {G1,G2, . . . ,Gm} is called a decomposition if they cover all the edges of G. Question: Can we use a different decomposition in order to get a continuum between LLL and Shearer’s condition? Answer: YES!
The Decomposition Theorem a set of events to avoid, a decomposition of dependency graph G. Decompostion theorem:
Applications • k-SAT • Acyclic Edge Coloring • Non-repetive Vertex Coloring • Statistical Mechacnics • Open problems: more application? • Thank you!
Application to Statistical Mechanics Uniform Shearer’s Bound: s.t. satisfies Shearer’s condition. [SS06] Phase transitions in the hard-core lattice gas model [Tod99] [SS06]