Rodica Dinu

On the maximum likelihood degree of Gaussian graphical models

Abstract In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML‐degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML‐degree of the cycle is larger than 1 for any , t...