Minimal I-Maps

Minimal I-Maps

• A graph G is said to be a minimal I-Map if deleting any edge would make G cease to be an I-Map:
• e.g.
  • X independent of Z
  • X dependent on Y
  • Y dependent on Z
  • X and Z dependent given Y

X

Y

Z

X

Y

Z

(Trivial) I-Map

Minimal I-Map

Previous slide

Next slide

Back to the first slide

View Graphic Version