Markov Equivalence for Ancestral Graphs


We prove that the criterion for Markov equivalence provided by Zhao et al. (2005) may involve a set of features of a graph that is exponential in the number of vertices. Zhao et al. (2005) define a collider path ν = 〈v1, . . . , vn〉 to be minimal if there is no subsequence of vertices 〈v1 = vi1 , . . . , vik = vn〉 which forms a collider path. They use this… (More)


1 Figure or Table


Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.