Complete quadrics: Schubert calculus for Gaussian models and semidefinite programming
From MaRDI portal
Symmetric functions and generalizations (05E05) Intersection theory, characteristic classes, intersection multiplicities in algebraic geometry (14C17) Rational and birational maps (14E05) Grassmannians, Schubert varieties, flag manifolds (14M15) Homogeneous spaces and generalizations (14M17) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Computational aspects of higher-dimensional varieties (14Q15) Gaussian processes (60G15) Algebraic statistics (62R01)
Abstract: We establish connections between: the maximum likelihood degree (ML-degree) for linear concentration models, the algebraic degree of semidefinite programming (SDP), and Schubert calculus for complete quadrics. We prove a conjecture by Sturmfels and Uhler on the polynomiality of the ML-degree. We also prove a conjecture by Nie, Ranestad and Sturmfels providing an explicit formula for the degree of SDP. The interactions between the three fields shed new light on the asymptotic behaviour of enumerative invariants for the variety of complete quadrics. We also extend these results to spaces of general matrices and of skew-symmetric matrices.
This page was built for publication: Complete quadrics: Schubert calculus for Gaussian models and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6353962)
