Reading dependencies from covariance graphs
From MaRDI portal
Abstract: The covariance graph (aka bi-directed graph) of a probability distribution is the undirected graph where two nodes are adjacent iff their corresponding random variables are marginally dependent in . In this paper, we present a graphical criterion for reading dependencies from , under the assumption that satisfies the graphoid properties as well as weak transitivity and composition. We prove that the graphical criterion is sound and complete in certain sense. We argue that our assumptions are not too restrictive. For instance, all the regular Gaussian probability distributions satisfy them.
Recommendations
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
- Gaussian covariance faithful Markov trees
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Covariance decomposition in undirected Gaussian graphical models
- Gaussian Markov distributions over finite graphs
Cited in
(4)
This page was built for publication: Reading dependencies from covariance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375355)