Positivity for Gaussian graphical models
From MaRDI portal
Abstract: Gaussian graphical models are parametric statistical models for jointly normal random variables whose dependence structure is determined by a graph. In previous work, we introduced trek separation, which gives a necessary and sufficient condition in terms of the graph for when a subdeterminant is zero for all covariance matrices that belong to the Gaussian graphical model. Here we extend this result to give explicit cancellation-free formulas for the expansions of nonzero subdeterminants.
Recommendations
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- A non-commutative version of Jacobi's equality on the cofactors of a matrix
- Binomial determinants, paths, and hook length formulae
- Global identifiability of linear structural equation models
- Half-trek criterion for generic identifiability of linear structural equation models
- Loop-erased walks and total positivity
- On a parametrization of positive semidefinite matrices with zeros
- On the Vector Representations of Induced Matroids
- Trek separation for Gaussian graphical models
Cited in
(8)- Brownian motion tree models are toric
- Gaussian graphical models with toric vanishing ideals
- Trek separation for Gaussian graphical models
- On a parametrization of positive semidefinite matrices with zeros
- Nested covariance determinants and restricted trek separation in Gaussian graphical models
- Causal Structural Learning via Local Graphs
- Partial correlation hypersurfaces in Gaussian graphical models
- Exact inference on Gaussian graphical models of arbitrary topology using path-sums
This page was built for publication: Positivity for Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394750)