Properties of d-connection
Properties of d-connection
- Property 1: If P is a path d-connecting X and Y given some set of evidence E then every vertex on P is an ancestor of X, Y or a vertex in E
- Property 2: If there is an edge X®Y or X¬Y, then X and Y are d-connected given every set E (X,YÏE)
- Property 3: In an acyclic graph G if X and Y are d-connected given every set E (X,YÏE) then either X®Y or X¬Y in G.
- Property 4: In an acyclic graph G if X and Y are d-separated given some set E (X,YÏE) then either:
- X and Y are d-separated given Parents(X) in G, or
- X and Y are d-separated given Parents(Y) in G