Graphical representation of independence structures

Explore this paper's citation graph

Summary

A unifying interpretation of independence structure for LMGs is defined and the equivalence of pairwise and global Markov properties for graphoids defined over the nodes of RGs is proved, enabling the derivation of algorithms to generate these graphs from a given DAG or from a graph of a specific subclass.

Type
dissertation
Published
2012-01-01
Cited by
6
References
50
Access
Open access

Keywords

Indifference graph, Chordal graph, Modular decomposition, Directed acyclic graph, Combinatorics

References

Cited by

Related papers