Michael D. Eichler
Abstract
Open-access reader
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Markov chain, Pathwidth, Mixed graph, Path (computing), Combinatorics, Mathematics, Characterization (materials science), Indifference graph