  We study the maximum likelihood (ML) degree of linear concentration models in
algebraic statistics. We relate it to an intersection problem on the variety of
complete quadrics. This allows us to provide an explicit, basic, albeit of high
computational complexity, formula for the ML-degree. The variety of complete
quadrics is an exact analog for symmetric matrices of the permutohedron variety
for the diagonal matrices.
