Definition: d-connecting path
Definition: d-connecting path
- A path between X and Y is said to d-connect X and Y given evidence E, (X,YÏ E) if:
- In every triple of the form A®B¬ C, B is an ancestor of a vertex in E
- In every other triple, i.e. of the form: A®B® C, A¬B® C, or A¬B¬ C B is not in E.
- If there is no path which d-connects X and Y given E then X and Y are said to be d-separated by E