Symmetries in directed Gaussian graphical models
From MaRDI portal
Abstract: We define Gaussian graphical models on directed acyclic graphs with coloured vertices and edges, calling them RDAG (restricted directed acyclic graph) models. If two vertices or edges have the same colour, their parameters in the model must be the same. We present an algorithm to find the maximum likelihood estimate (MLE) in an RDAG model, and characterise when the MLE exists, via linear independence conditions. We relate properties of a graph, and its colouring, to the number of samples needed for the MLE to exist and to be unique. We also characterise when an RDAG model is equal to an associated undirected graphical model and study connections to groups and invariant theory. We provide examples and simulations to study the benefits of RDAGs over uncoloured DAGs.
Cites work
- Algebraic problems in structural equation modeling
- Book review of: S. Sullivant, Algebraic statistics
- Causality. Models, reasoning, and inference
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Geometric Invariant Theory
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Global identifiability of linear structural equation models
- Graphical Gaussian Models With Edge and Vertex Symmetries
- Group symmetry and covariance regularization
- Handbook of Graphical Models
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- scientific article; zbMATH DE number 469396 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1822312 (Why is no real title available?)
- scientific article; zbMATH DE number 7351371 (Why is no real title available?)
- Identifiability of Gaussian structural equation models with equal error variances
- Invariant normal models with recursive graphical Markov structure.
- Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
- Maximum likelihood estimation for matrix normal models via quiver representations
- Maximum likelihood estimation for tensor normal models via castling transforms
- Model selection for factorial Gaussian graphical models with an application to dynamic regulatory networks
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- Polynomial degree bounds for matrix semi-invariants
- Sparse inverse covariance estimation with the graphical lasso
- Symmetry and lattice conditional independence in a multivariate normal distribution
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- The maximum likelihood threshold of a graph
- The maximum likelihood threshold of a path diagram
Cited in
(8)- Estimation of means in graphical Gaussian models with symmetries
- Symmetrically Colored Gaussian Graphical Models with Toric Vanishing Ideals
- Maximum likelihood thresholds via graph rigidity
- A bridge between invariant theory and maximum likelihood estimation
- Toric multivariate Gaussian models from symmetries in a tree
- Complete collineations for maximum likelihood estimation
- Coloured Gaussian directed acyclic graphical models
- Maximum likelihood estimation for Brownian motion tree models based on one sample
This page was built for publication: Symmetries in directed Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144450)
