Dependency graph of events

A dependency graph of events joins potentially dependent events. Each event must be independent of the sigma-algebra generated by all its nonneighbors, a joint condition stronger than pairwise independence. In a product probability space, joining events whose sets of underlying independent variables overlap gives such a graph. This supplies the hypothesis of the Lovász local lemma.

For events $A_i$, a directed graph is an independence digraph if $A_i$ is independent of the sigma-algebra generated by the events indexed by its non-outneighbors, excluding $i$. The direction records which joint independence condition is available. A cyclically oriented triangle imposes pairwise independence; it does not impose independence of all three events together.