Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
From MaRDI portal
Publication:2149807
Abstract: The gaussoid axioms are conditional independence inference rules which characterize regular Gaussian CI structures over a three-element ground set. It is known that no finite set of inference rules completely describes regular Gaussian CI as the ground set grows. In this article we show that the gaussoid axioms logically imply every inference rule of at most two antecedents which is valid for regular Gaussians over any ground set. The proof is accomplished by exhibiting for each inclusion-minimal gaussoid extension of at most two CI statements a regular Gaussian realization. Moreover we prove that all those gaussoids have rational positive-definite realizations inside every -ball around the identity matrix. For the proof we introduce the concept of algebraic Gaussians over arbitrary fields and of positive Gaussians over ordered fields and obtain the same two-antecedental completeness of the gaussoid axioms for algebraic and positive Gaussians over all fields of characteristic zero as a byproduct.
Recommendations
- The geometry of gaussoids
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Gaussian conditional independence relations have no finite complete characterization
- On Gaussian conditional independence structures
- Conditionals, Information, and Inference
Cites work
- scientific article; zbMATH DE number 176109 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A note on a generalized Cramer's rule
- Algebraic statistics
- Conditional Independences among Four Random Variables III: Final Conclusion
- Conditional Independences among Four Random Variables I
- Conditional Independences among Four Random Variables II
- Conditional independence and basic Markov properties
- Conditional independence structures examined via minors
- Conditionals, Information, and Inference
- Construction methods for gaussoids.
- Efficient algorithms for conditional independence inference
- Gaussian conditional independence relations have no finite complete characterization
- Hyperdeterminantal relations among symmetric principal minors
- Ideals, Varieties, and Algorithms
- Logical and algorithmic properties of conditional independence and graphical models
- On Gaussian conditional independence structures
- On the conditional independence implication problem: a lattice-theoretic approach
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- Positive polynomials and sums of squares
- Smoothness of Gaussian conditional independence models
- The geometry of gaussoids
- Towards classification of semigraphoids.
- Unifying Markov properties for graphical models
Cited in
(5)
This page was built for publication: Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149807)