Marginalization and conditioning for LWF chain graphs

From MaRDI portal
Publication:309746

DOI10.1214/16-AOS1451zbMATH Open1359.62284arXiv1405.7129MaRDI QIDQ309746FDOQ309746

Kayvan Sadeghi

Publication date: 7 September 2016

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion under which the class of CMGs is stable under marginalization and conditioning and contains the class of LWF CGs as its subclass. We provide a method for generating such graphs after marginalization and conditioning for a given CMG or a given LWF CG. We then define and study the class of anterial graphs, which is also stable under marginalization and conditioning and contains LWF CGs, but has a simpler structure than CMGs.


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




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Marginalization and conditioning for LWF chain graphs

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