Geometry of maximum likelihood estimation in Gaussian graphical models

Details Geometry of maximum likelihood estimation in Gaussian graphical models Geometry of maximum likelihood estimation in Gaussian graphical models

2010-12-13

arxiv.org/abs/1012.2643v1

Mathematics

Statistics Theory

18 pages, 8 figures, 5 tables

Scientific paper

We study maximum likelihood estimation in Gaussian graphical models from a geometric point of view. An algebraic elimination criterion allows us to find exact lower bounds on the number of observations needed to ensure that the maximum likelihood estimator exists with probability one. This is applied to bipartite graphs, grids and colored graphs. We also study the ML degree, and we present the first instance of a graph for which the MLE exists with probability one even when the number of observations equals the treewidth.

Affiliated with

Also associated with

No associations

Rating

Geometry of maximum likelihood estimation in Gaussian graphical models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Geometry of maximum likelihood estimation in Gaussian graphical models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometry of maximum likelihood estimation in Gaussian graphical models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26661