Transitive property of connection in undirected graphs

Transitive property of connection in undirected graphs

• In an undirected graph if X is connected to Y, and Y is conected to Z, then X is connected to Z.
• In contrast, in a directed graph it is possible for
  • X and Y to be d-connected given evidence E,
  • Y and Z to be d-connected given evidence E
  • But X and Z to be d-separated given evidence E

X

Y

Z

E

Previous slide

Next slide

Back to the first slide

View Graphic Version