D-separation blocks paths through conditioned noncolliders and through unconditioned colliders without conditioned descendants.
A set d-separates two vertex sets when it blocks every path between them.
Conditioned on its parents, a vertex is d-separated from all nondescendants other than those parents.

Ancestors (5)

  1. Directed acyclic graph
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5. Home

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