Trek separation for Gaussian graphical models
From MaRDI portal
Publication:973882
Abstract: Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional independence constraints on collections of random variables. We give a precise graph-theoretic characterization of when submatrices of the covariance matrix have small rank for a general class of mixed graphs that includes directed acyclic and undirected graphs as special cases. Our new trek separation criterion generalizes the familiar -separation criterion. Proofs are based on the trek rule, the resulting matrix factorizations and classical theorems of algebraic combinatorics on the expansions of determinants of path polynomials.
Recommendations
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- Algebraic geometry of Gaussian Bayesian networks
- Alternative Markov properties for chain graphs
- Ancestral graph Markov models.
- Binomial determinants, paths, and hook length formulae
- Causation, prediction, and search
- Loop-erased walks and total positivity
- Moments of minors of Wishart matrices
- On the Vector Representations of Induced Matroids
- The Method of Path Coefficients
Cited in
(26)- Learning unfaithful \(K\)-separable Gaussian graphical models
- Brownian motion tree models are toric
- Matrix Schubert varieties and Gaussian conditional independence models
- Gaussian graphical models with toric vanishing ideals
- The reduced PC-algorithm: improved causal structure learning in large random networks
- Positivity for Gaussian graphical models
- Characterization of convolution splitting graphical models
- Stratified Gaussian graphical models
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- Coherent combination of probabilistic outputs for group decision making: an algebraic approach
- Nested covariance determinants and restricted trek separation in Gaussian graphical models
- Geometry of the faithfulness assumption in causal inference
- Causal Structural Learning via Local Graphs
- Wald tests of singular hypotheses
- Directed Gaussian graphical models with toric vanishing ideals
- Partial correlation hypersurfaces in Gaussian graphical models
- Half-trek criterion for identifiability of latent variable models
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- Multi-Trek Separation in Linear Structural Equation Models
- Learning instrumental variables with structural and non-Gaussianity assumptions
- Comments on: Sequences of regressions and their independencies
- Identifying species network features from gene tree quartets under the coalescent model
- Directed expected utility networks
- scientific article; zbMATH DE number 7626718 (Why is no real title available?)
- Half-trek criterion for generic identifiability of linear structural equation models
- Computing maximum likelihood estimates for Gaussian graphical models with Macaulay2
This page was built for publication: Trek separation for Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973882)
