Counting Markov Equivalence Classes by Number of Immoralities

Adityanarayanan Radhakrishnan, Liam Solus, Caroline Uhler

Two directed acyclic graphs (DAGs) are called Markov equivalent if and only if they have the same underlying undirected graph (i.e. skeleton) and the same set of immoralities. Usin…