Matroid Stratification of ML Degrees of Independence Models
Statistics Theory
2024-12-04 v2 Algebraic Geometry
Combinatorics
Statistics Theory
Abstract
We study the maximum likelihood (ML) degree of discrete exponential independence models and models defined by the second hypersimplex. For models with two independent variables, we show that the ML degree is an invariant of a matroid associated to the model. We use this description to explore ML degrees via hyperplane arrangements. For independence models with more variables, we investigate the connection between the vanishing of factors of its principal -determinant and its ML degree. Similarly, for models defined by the second hypersimplex, we determine its principal -determinant and give computational evidence towards a conjectured lower bound of its ML degree.
Keywords
Cite
@article{arxiv.2312.10010,
title = {Matroid Stratification of ML Degrees of Independence Models},
author = {Oliver Clarke and Serkan Hoşten and Nataliia Kushnerchuk and Janike Oldekop},
journal= {arXiv preprint arXiv:2312.10010},
year = {2024}
}
Comments
24 pages, 3 figures, 6 tables