OurBigBook About$ Donate
 Sign in Sign up

Skeleton and collider characterization of Markov equivalence

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Directed acyclic graph Markov equivalence of directed acyclic graphs
2026-10-05  0 By others on same topic  0 Discussions Create my own version
Two Directed acyclic graphs are Markov equivalent directed acyclic graphs if and only if they have the same skeleton of a directed graph and the same unshielded colliders. Thus these two structures determine the observational equivalence class. This structural theorem is what converts the skeleton and collider phases of the PC algorithm into identification of an equivalence class.

 Ancestors (6)

  1. Markov equivalence of directed acyclic graphs
  2. Directed acyclic graph
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 205 / 4 / Solution
  • Population PC correctness under faithfulness

 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