# Difference and relation between dependency graph and graphical model?

1. Let $A_1 , A_2 , \dots, A_n$ be $n$ events on a probability space $Ω$. The dependency graph is a directed graph $D = (V, E)$ on the set of vertices $V =\{1, \dots, n\}$ (corresponding to $A_1 , A_2 , \dots, A_n$ ) if for each $1 ≤ i ≤ n$, $A_i$ is mutually independent of all the events $\{A_j : (i, j) \notin E\}$.

2. In a graphical model, each vertex represents a random variable. Any two vertices are conditionally independent given the values of their parents. In general, any two sets of nodes are conditionally independent given a third set if a criterion called d-separation holds in the graph.

Dependency graphs and graphical models are very similar in that both represent random variables represented as vertices (an event can be seen as a random variable by taking the indicator function of the event), and encode their dependency relation in edges.

So I wonder if they are related somehow, and can be converted to each other?

Thanks!

-