The maximum likelihood threshold of a graph

DOI10.3150/16-BEJ881zbMath1426.62167arXiv1404.6989WikidataQ57423808 ScholiaQ57423808MaRDI QIDQ2405187

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

zbMATH Keywords

maximum likelihood estimationmatrix completionGaussian graphical modelsalgebraic matroidsrigidity theorymaximum likelihood thresholdscore matching estimatorweak maximum likelihood threshold

Mathematics Subject Classification ID

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

Related Items (11)

Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022 ⋮ Symmetries in directed Gaussian graphical models ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Maximum likelihood threshold and generic completion rank of graphs ⋮ Typical ranks in symmetric matrix completion ⋮ Algebraic Matroids in Action ⋮ Existence and uniqueness of the Kronecker covariance MLE ⋮ Maximum likelihood estimation in Gaussian models under total positivity ⋮ Typical and generic ranks in matrix completion ⋮ Locally associated graphical models and mixed convex exponential families ⋮ Sharp lower and upper bounds for the Gaussian rank of a graph

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