A note on global Markov properties for mixed graphs

Abstract

Global Markov properties in mixed graphs are usually formulated in terms of the path-oriented m-separation or by use of augmented graphs (similar to moral graphs in the case of directed acyclic graphs). We provide an alternative characterization that can be easily implemented.