 Independence digraph of events

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.