A Dependence/Independence Model
A Dependence/Independence Model
- A directed graph together with the graphical criterion of a d-connecting path can be thought of as defining:
- A set of dependence relations:
- X and Y are d-connected given E Þ X and Y are dependent given E. (In this case the graph is called a D-Map)
- A set of independence relations:
- X and Y are d-separated given E Þ X and Y are independent given E (In this case the graph is called an I-Map)
- Both dependence and independence relations
- In this case the graph is called a perfect map.