A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A characterization of Markov equivalence for directed cyclic graphs
1997
International Journal of Approximate Reasoning
The concept of d-separation (Pearl, 1988) was originally defined for acyclic directed graphs, but there is a natural extension of the concept to directed graphs with cycles. When exactly the same set of d-separation relations hold in two directed graphs, no matter whether respectively cyclic or acyclic, we say that they are Markov equivalent. In other words, when two directed cyclic graphs are Markov equivalent, the set of distributions that satisfy a natural extension of the global directed
doi:10.1016/s0888-613x(97)00020-0
fatcat:gdvzgj3gbjacxj4gnqyh4vajzy