Linear Spaces of Symmetric Matrices with Non-Maximal Maximum Likelihood Degree

11/30/2020
by   Kathlén Kohn, et al.
0

We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the set of linear spaces that do not attain their maximal possible maximum likelihood degree coincides with the Zariski closure of the set of linear spaces defining a projection with non-closed image of the positive semidefinite cone. In particular, this shows that this closure is a union of coisotropic hypersurfaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2020

The Maximum Likelihood Degree of Linear Spaces of Symmetric Matrices

We study multivariate Gaussian models that are described by linear condi...
research
06/17/2020

Bad Projections of the PSD Cone

The image of the cone of positive semidefinite matrices under a linear m...
research
01/24/2023

Logarithmically Sparse Symmetric Matrices

A positive definite matrix is called logarithmically sparse if its matri...
research
04/10/2014

Open problem: Tightness of maximum likelihood semidefinite relaxations

We have observed an interesting, yet unexplained, phenomenon: Semidefini...
research
04/26/2018

Closed codon models: just a hopeless dream?

The "Lie closure" of a set of matrices is the smallest matrix Lie algebr...
research
03/30/2020

Parallel Computation of tropical varieties, their positive part, and tropical Grassmannians

In this article, we present a massively parallel framework for computing...
research
11/17/2020

Complete quadrics: Schubert calculus for Gaussian models and semidefinite programming

We establish connections between: the maximum likelihood degree (ML-degr...

Please sign up or login with your details

Forgot password? Click here to reset