Drton–Sturmfels–Sullivant conjecture on the ML-degree of cycle graphs
Let be the cycle graph on vertices, and let denote the number of critical points of the Gaussian log-likelihood function for generic sample covariance data, equivalently the maximum likelihood degree of the corresponding Gaussian graphical model. Drton–Sturmfels–Sullivant conjecture.
This conjecture predicts the observed ML-degrees of cycle graphs and gives an explicit formula for their algebraic statistical complexity. The supplied text does not state whether the conjecture has been proved or disproved.
References
- Carlos Améndola, Rodica Andreea Dinu, Mateusz Michałek and Martin Vodička, “On the maximum likelihood degree for Gaussian graphical models”, arXiv:2410.07007 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.