Geometry of maximum likelihood estimation in Gaussian graphical models
From MaRDI portal
Publication:450030
DOI10.1214/11-AOS957zbMath1246.62140arXiv1012.2643MaRDI QIDQ450030
Publication date: 3 September 2012
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.2643
dualitytreewidthbipartite graphssufficient statisticsalgebraic varietyalgebraic statisticsmatrix completion problemselimination idealML degreenumber of observations
Estimation in multivariate analysis (62H12) Applications of graph theory (05C90) Computational aspects in algebraic geometry (14Q99)
Related Items (23)
A probabilistic algorithm for computing data-discriminants of likelihood equations ⋮ Likelihood Geometry ⋮ Groups acting on Gaussian graphical models ⋮ Computing mixed volume and all mixed cells in quermassintegral time ⋮ Do Sums of Squares Dream of Free Resolutions? ⋮ The Maximum Likelihood Degree of Mixtures of Independence Models ⋮ On Sidorenko's conjecture for determinants and Gaussian Markov random fields ⋮ Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022 ⋮ Computing maximum likelihood estimates for Gaussian graphical models with Macaulay2 ⋮ Symmetries in directed Gaussian graphical models ⋮ Maximum likelihood threshold and generic completion rank of graphs ⋮ Unnamed Item ⋮ On the existence of the weighted bridge penalized Gaussian likelihood precision matrix estimator ⋮ Typical ranks in symmetric matrix completion ⋮ A review of Gaussian Markov models for conditional independence ⋮ Maximum likelihood estimation in Gaussian models under total positivity ⋮ Typical and generic ranks in matrix completion ⋮ Maximum Likelihood Degree, Complete Quadrics, and $\mathbb{C}^*$-Action ⋮ Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields ⋮ Linear estimating equations for exponential families with application to Gaussian linear concentration models ⋮ Locally associated graphical models and mixed convex exponential families ⋮ Sharp lower and upper bounds for the Gaussian rank of a graph ⋮ Singularity Structures and Impacts on Parameter Estimation in Finite Mixtures of Distributions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of means in graphical Gaussian models with symmetries
- Positive definite completions of partial Hermitian matrices
- Lectures on algebraic statistics
- The real positive definite completion problem for a simple cycle
- Basicness of semialgebraic sets
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- The real positive definite completion problem: cycle completability
This page was built for publication: Geometry of maximum likelihood estimation in Gaussian graphical models