Author:
HEMMECKE RAYMOND,MORTON JASON,SHIU ANNE,STURMFELS BERND,WIENAND OLIVER
Abstract
Semi-graphoids 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 Sn. In this paper we resolve two problems on semi-graphoids posed in Studený's book (2005), and we answer a related question of Postnikov, Reiner and Williams on generalized permutohedra. We also study the semigroup and the toric ideal associated with semi-graphoids.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference22 articles.
1. Conditional Independences among Four Random
Variables III: Final Conclusion
2. [10] Hemmecke R. , Takemura A. and Yoshida R. Computing holes in semi-groups. Preprint available at: math.CO/0607599.
3. Probabilités conditionnelles et permutaèdre
4. [11] Hirai H. (2006) Sequences of stellar subdivisions. Preprint.
5. On the toric algebra of graphical models
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献