Abstract
The relations among the classes of multivariate conditional independence models determined by directed acyclic graphs (DAG), undirected graphs (UDG), decomposable graphs (DEC), and finite distributive lattices (LCI) are investigated. First, LCI models that admit positive joint densities are characterized in terms of an appropriate factorization of the density. This factorization is then recognized as a particular form of the recursive factorization that characterizes DAG models, thereby establishing that the LCI models comprise a subclass of the class of DAG models. Precisely, the class of LCI models coincides with the subclass of transitive DAG models. Furthermore, the class of LCI models has nontrivial intersection with the class of DEC models. A series of examples illustrating these relations are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
