Sullivant's saturation conjecture for Gaussian DAG models
Sullivant's saturation conjecture for Gaussian DAG models
Let be a directed acyclic graph, let be the vanishing ideal of its Gaussian model, and let be its global conditional independence ideal. Define
Sullivant's saturation conjecture. The vanishing ideal satisfies
This conjecture concerns the relationship between the parametric definition of a Gaussian DAG model and the polynomial constraints arising from its global Markov properties. The source states that the paper proves the result, but the supplied status is unknown; its resolution should be checked.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Tobias Boege, Kaie Kubjas, Pratik Misra and Liam Solus, “Colored Gaussian directed acyclic graphical models”, arXiv:2404.04024 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.