• Corpus ID: 235435709

Markov equivalence of max-linear Bayesian networks

  title={Markov equivalence of max-linear Bayesian networks},
  author={Carlos Am'endola and Benjamin Hollering and Seth Sullivant and Ngoc Khue Tran},
Max-linear Bayesian networks have emerged as highly applicable models for causal inference via extreme value data. However, conditional independence (CI) for max-linear Bayesian networks behaves differently than for classical Gaussian Bayesian networks. We establish the parallel between the two theories via tropicalization, and establish the surprising result that the Markov equivalence classes for max-linear Bayesian networks coincide with the ones obtained by regular CI. Our paper opens up… 
2 Citations

Figures from this paper

The tropical geometry of causal inference for extremes
In this paper, intuition is given, backed by performances on benchmark datasets, for why and when causal inference for extremes should be employed over classical methods.


Bayesian Networks for Max-Linear Models
It is argued that the structure of a minimal network asymptotically can be identified completely from observational data.
Conditional independence in max-linear Bayesian networks
This work uses tropical linear algebra to derive a compact representation of the conditional distribution given a partial observation, and exploits this to obtain a complete description of all conditional independence relations.
Estimating an extreme Bayesian network via scalings
Identifying independence in bayesian networks
This article characterizes all independence assertions that logically follow from the topology of a network and develops a linear time algorithm that identifies these assertions and is shown to work for a broad class of nonprobabilistic independencies.
Graphical models for extremes
A general theory of conditional independence for multivariate Pareto distributions is introduced that enables the definition of graphical models and sparsity for extremes and it is shown that, similarly to the Gaussian case, the sparsity pattern of a general extremal graphical model can be read off from suitable inverse covariance matrices.
Strong completeness and faithfulness in Bayesian networks
It is shown that in a strong measure-theoretic sense almost all discrete distributions for a given network structure are faithful; i.e. the independence facts true of the distribution are all and only those entailed by the network structure.
Recursive max-linear models with propagating noise
A probabilistic analysis of this new noisy model reveals that the unique minimum DAG representing the distribution of the non-noisy model remains unchanged and identifiable, and it is proved that the estimated Kleene star matrix converges to a matrix of independent Weibull entries after proper centering and scaling.
Trek separation for Gaussian graphical models
This work gives a precise graph-theoretic characterization of when submatrices of the covariance matrix have small rank for a general class of mixed graphs that includes directed acyclic and undirected graphs as special cases.
Identifiability and estimation of recursive max‐linear models
This work addresses the identifiability and estimation of recursive max‐linear structural equation models represented by an edge‐weighted directed acyclic graph (DAG) and develops a simple method for identifying the structure of the DAG.