OurBigBook About$ Donate
 Sign in Sign up

Markov blanket D-separation

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Statistical model Probabilistic graphical model Markov blanket
2026-10-06  0 By others on same topic  0 Discussions Create my own version
In a Directed acyclic graph, let B contain the parents, children, and other parents of children of vertex k. Then k is D-separated from all remaining vertices by B. Every path out of k meets a conditioned noncollider either at a parent, at a child, or at another parent just after a conditioned child-collider. The global Markov property for a directed acyclic graph gives Zk​⊥Z(B∪{k})c​∣ZB​.

 Ancestors (7)

  1. Markov blanket
  2. Probabilistic graphical model
  3. Statistical model
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 205 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook