A graphical characterization of lattice conditional independence models

Abstract

Lattice conditional independence (LCI) models for multivariate normal data recently have been introduced for the analysis of nondmonotone missing data patterns and of nonnested dependent linear regression models (\equiv seemingly unrelated regressions). It is shown here that the class of LCI models coincides with a subclass of the class of graphical Markov models determined by acyclic digraphs (ADGs), namely, the subclass of transitive ADG models. An explicit graphdtheoretic characterization of those ADGs that are Markov equivalent to some transitive ADG is obtained. This characterization allows one to determine whether a specific ADG D is Markov equivalent to some transitive ADG, hence to some LCI model, in polynomial time, without an exhaustive search of the (possibly superexponentially large) equivalence class [D]. These results do not require the existence or positivity of joint densities.