The Lefthanded Local Lemma characterizes chordal dependency graphs

Details The Lefthanded Local Lemma characterizes chordal dependency graphs The Lefthanded Local Lemma characterizes chordal dependency graphs

2012-04-26

arxiv.org/abs/1204.5922v1

Mathematics

Combinatorics

12 pages, 1 figure

Scientific paper

Shearer gave a general theorem characterizing the family $\LLL$ of dependency graphs labeled with probabilities $p_v$ which have the property that for any family of events with a dependency graph from $\LLL$ (whose vertex-labels are upper bounds on the probabilities of the events), there is a positive probability that none of the events from the family occur. We show that, unlike the standard Lov\'asz Local Lemma---which is less powerful than Shearer's condition on every nonempty graph---a recently proved `Lefthanded' version of the Local Lemma is equivalent to Shearer's condition for all chordal graphs. This also leads to a simple and efficient algorithm to check whether a given labeled chordal graph is in $\LLL$.

Affiliated with

Also associated with

No associations

Rating

The Lefthanded Local Lemma characterizes chordal dependency graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Lefthanded Local Lemma characterizes chordal dependency graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Lefthanded Local Lemma characterizes chordal dependency graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314444