The maximum likelihood threshold of a graph

DOI10.3150/16-BEJ881MaRDI QIDQ2405187zbMATH OpenWikidataFDO

Authors Elizabeth Gross, Seth Sullivant

Publication date 21 September 2017

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.6989, https://projecteuclid.org/euclid.bj/1501142448

zbMATH Keywords

algebraic matroidsGaussian graphical modelsmatrix completionmaximum likelihood estimationmaximum likelihood thresholdrigidity theoryscore matching estimatorweak maximum likelihood threshold

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Estimation in multivariate analysis (62H12)

Abstract: The maximum likelihood threshold of a graph is the smallest number of data points that guarantees that maximum likelihood estimates exist almost surely in the Gaussian graphical model associated to the graph. We show that this graph parameter is connected to the theory of combinatorial rigidity. In particular, if the edge set of a graph $G$ is an independent set in the $n-1$-dimensional generic rigidity matroid, then the maximum likelihood threshold of $G$ is less than or equal to $n$. This connection allows us to prove many results about the maximum likelihood threshold.

Recommendations

• Maximum likelihood threshold and generic completion rank of graphs
• Geometry of maximum likelihood estimation in Gaussian graphical models
• Sharp lower and upper bounds for the Gaussian rank of a graph
• The maximum likelihood threshold of a path diagram
• scientific article; zbMATH DE number 469396

Cited in

(24)

• Maximum likelihood threshold and generic completion rank of graphs
• Typical ranks in symmetric matrix completion
• Existence and uniqueness of the Kronecker covariance MLE
• Locally associated graphical models and mixed convex exponential families
• Maximum likelihood estimation in Gaussian models under total positivity
• Typical and generic ranks in matrix completion
• Sharp lower and upper bounds for the Gaussian rank of a graph
• The maximum likelihood threshold of a path diagram
• A survey of discrete methods in (algebraic) statistics for networks
• scientific article; zbMATH DE number 469396 (Why is no real title available?)
• Geometry of maximum likelihood estimation in Gaussian graphical models
• Algebraic matroids in action
• Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022
• Symmetries in directed Gaussian graphical models
• Computing maximum likelihood thresholds using graph rigidity
• Maximum likelihood thresholds via graph rigidity
• The codegree, weak maximum likelihood threshold, and the Gorenstein property of hierarchical models
• Pseudolikelihood estimators for graphical models: existence and uniqueness
• Entropic covariance models
• On some algorithms for estimation in Gaussian graphical models
• The existence of unbiased hypothesis tests: an algebraic approach
• Complete collineations for maximum likelihood estimation
• Maximum likelihood thresholds of generic linear concentration models
• Maximum likelihood thresholds of Gaussian graphical models and graphical lasso

This page was built for publication: The maximum likelihood threshold of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2405187)