• DOI:10.3150/16-BEJ881
Corpus ID: 4646772

The maximum likelihood threshold of a graph

@article{Gross2014TheML,
  title={The maximum likelihood threshold of a graph},
  author={E. Gross and S. Sullivant},
  journal={Bernoulli},
  year={2014},
  volume={24},
  pages={386-407}
}

E. Gross, S. Sullivant

Published 2014

Mathematics

Bernoulli

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed