Three Counter-Examples on Semi-Graphoids

DOI10.1017/S0963548307008838MaRDI QIDQ3512602zbMATH OpenOpenAlexFDO

Authors Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand

Publication date 21 July 2008

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0610451

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Nonparametric inference (62G99) Applications of statistics (62P99) Learning and adaptive systems in artificial intelligence (68T05)

Abstract: Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on semigraphoids posed in Studeny's book, and we answer a related question by Postnikov, Reiner, and Williams on generalized permutohedra. We also study the semigroup and the toric ideal associated with semigraphoids.

Recommendations

• Towards classification of semigraphoids.
• Convex rank tests and semigraphoids
• Conditional independence structures examined via minors
• STRUCTURAL SEMIGRAPHOIDS¹
• A computational algebraic-geometry method for conditional-independence inference

Cites work

• Algebraic algorithms for sampling from conditional distributions
• Conditional Independences among Four Random Variables III: Final Conclusion
• Conditional probabilities and permutahedron.
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• On the toric algebra of graphical models
• Polytopal and nonpolytopal spheres. An algorithmic approach
• STRUCTURAL SEMIGRAPHOIDS¹
• Towards classification of semigraphoids.

Cited in

(11)

• Lengths of semigraphoid inferences
• On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
• Standard imsets for undirected and chain graphical models
• Convex rank tests and semigraphoids
• A computational algebraic-geometry method for conditional-independence inference
• Generalized Permutohedra from Probabilistic Graphical Models
• On open questions in the geometric approach to structural learning Bayesian nets
• Construction methods for gaussoids.
• Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022
• Towards standard imsets for maximal ancestral graphs
• Self-adhesivity in lattices of abstract conditional independence models

Describes a project that uses

Uses Software

• Normaliz
• 4ti2
• polymake
• Macaulay2

This page was built for publication: Three Counter-Examples on Semi-Graphoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512602)