Graphical Models and Inference - Lecture 2

Markov properties for undirected graphs

This lecture discusses the fundamentals of conditional independence relations expressible through finite and undirected graphs. In particular there is some focus on the relation between related, but different ways of expressing Markov properties.



Previous lecture

Next lecture

Course overview

Last updated: Monday, 17 October 2011Steffen L. Lauritzen