Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In Bayesian network graphs, how to systematically search for pairs of conditional independent nodes, and the associated condition node(s)? Is there some simple rules or algorithms to follow?

share|cite|improve this question
up vote 1 down vote accepted

There is the Bayes-Ball Algorithm, described in this paper:

On page 22 of these slides there is a handy diagram that summarizes the algorithm:

share|cite|improve this answer

Yes, you can find conditionally independent nodes by evaluating the graphical structure of the Bayesian network. Check out the notion of D-separability which provides 3 rules:

1) X -> Y -> Z

2) X <- Y -> Z

For both (1) and (2), Z is conditionally independent of X given Y

3) X -> Y <- Z
X and Z are marginally independent, however, given Y (or any descendant of Y), they become conditionally dependent!

Andrew Moore has some explanation of these rules on his website.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.