Correlation graph of events
= Correlation graph of events
= Lopsidependency graph
{synonym}
For bad events $A_i$, a correlation graph is sufficient for the <Lopsided Lovász local lemma> when, for every set $S$ of nonneighbors and every positive-probability conditioning event, $\mathbb P(A_i\mid\bigcap_{j\in S}A_j^c)\leq\mathbb P(A_i)$. A <dependency graph of events> satisfies this with equality. The condition concerns simultaneous avoidance, not just signs of pairwise correlations.