Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks

no code implementations • 3 Oct 2022 • Danai Deligeorgaki, Alex Markham, Pratik Misra, Liam Solus

We consider the problem of estimating the marginal independence structure of a Bayesian network from observational data, learning an undirected graph we call the unconditional dependence graph.

A Transformational Characterization of Unconditionally Equivalent Bayesian Networks

no code implementations • 1 Mar 2022 • Alex Markham, Danai Deligeorgaki, Pratik Misra, Liam Solus

We consider the problem of characterizing Bayesian networks up to unconditional equivalence, i. e., when directed acyclic graphs (DAGs) have the same set of unconditional $d$-separation statements.