Polyhedral Aspects of Maxoids

Abstract

The conditional independence (CI) relation of a distribution in a max-linear Bayesian network depends on its weight matrix through the $C^{\ast }$-separation criterion. These CI~models, which we call maxoids, are compositional graphoids which are in general not representable by Gaussian random variables. We prove that every maxoid can be obtained from a transitively closed weighted DAG and show that the stratification of generic weight matrices by their maxoids yields a polyhedral~fan. We also use this connection to polyhedral geometry to develop an algorithm for solving the conditional independence implication problem for maxoids.

29 pages, 7 figures. Submitted to the Kybernetika special edition for WUPES'25