Combinatorica
On Dependency Graphs and the Lattice Gas
Combinatorics, Probability and Computing
Highly nonrepetitive sequences: Winning strategies from the local lemma
Random Structures & Algorithms
| Hi-index | 0.00 |
Shearer gave a general theorem characterizing the family \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}$\mathcal{L}$\end{document} **image**of dependency graphs labeled with probabilities pv which have the property that for any family of events with a dependency graph from \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}$\mathcal{L}$\end{document} **image** (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ász 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 \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}$\mathcal{L}$\end{document} **image** . © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.