Joint response graphs and separation induced by triangular systems

Summary.  We consider joint probability distributions generated recursively in terms of univariate conditional distributions satisfying conditional independence restrictions. The independences are captured by missing edges in a directed graph. A matrix form of such a graph, called the generating edge matrix, is triangular so the distributions that are generated over such graphs are called triangular systems. We study consequences of triangular systems after grouping or reordering of the variables for analyses as chain graph models, i.e. for alternative recursive factorizations of the given density using joint conditional distributions. For this we introduce families of linear triangular equations which do not require assumptions of distributional form. The strength of the associations that are implied by such linear families for chain graph models is derived. The edge matrices of chain graphs that are implied by any triangular system are obtained by appropriately transforming the generating edge matrix. It is shown how induced independences and dependences can be studied by graphs, by edge matrix calculations and via the properties of densities. Some ways of using the results are illustrated.

[1]  Statistical Dependence and Independence , 2005 .

[2]  Tom Burr,et al.  Causation, Prediction, and Search , 2003, Technometrics.

[3]  T. Richardson.  Markov Properties for Acyclic Directed Mixed Graphs , 2003 .

[4]  J. Koster.  Marginalizing and conditioning in graphical models , 2002 .

[5]  Graham J. Wills,et al.  Introduction to graphical modelling , 1995 .

[6]  P. Spirtes,et al.  Ancestral graph Markov models , 2002 .

[7]  D. Madigan,et al.  Separation and Completeness Properties for Amp Chain Graph Markov Models , 2001 .

[8]  Nanny Wermuth,et al.  Graphical models: overview , 2001 .

[9]  Nanny Wermuth,et al.  Likelihood Factorizations for Mixed Discrete and Continuous Variables , 1999 .

[10]  Nanny Wermuth,et al.  On association models defined over independence graphs , 1998 .

[11]  M. Studený,et al.  On chain graph models for description of conditional independence structures , 1998 .

[12]  David Madigan,et al.  An Alternative Markov Property for Chain Graphs , 1996, UAI.

[13]  Nanny Wermuth,et al.  Multivariate Dependencies: Models, Analysis and Interpretation , 1996 .

[14]  Christopher Meek,et al.  Strong completeness and faithfulness in Bayesian networks , 1995, UAI.

[15]  N. Wermuth,et al.  Linear Dependencies Represented by Chain Graphs , 1993 .

[16]  Nanny Wermuth,et al.  Response models for mixed binary and quantitative variables , 1992 .

[17]  L. N. Kanal,et al.  Uncertainty in Artificial Intelligence 5 , 1990 .

[18]  N. Wermuth,et al.  On Substantive Research Hypotheses, Conditional Independence Graphs and Graphical Chain Models , 1990 .

[19]  Steffen L. Lauritzen,et al.  Independence properties of directed markov fields , 1990, Networks.

[20]  M. Frydenberg.  The chain graph Markov property , 1990 .

[21]  J. Q. Smith.  Influence Diagrams for Statistical Modelling , 1989 .

[22]  N. Wermuth,et al.  Graphical Models for Associations between Variables, some of which are Qualitative and some Quantitative , 1989 .

[23]  Dan Geiger,et al.  On the logic of causal models , 2013, UAI.

[24]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[25]  Nanny Wermuth,et al.  Parametric Collapsibility and the Lack of Moderating Effects in Contingency Tables with a Dichotomous Response Variable , 1987 .

[26]  Douglas M. Hawkins,et al.  Elements of Continuous Multivariate Analysis , 1969 .

[27]  Frederick E. Smith,et al.  Matrix Algebra for the Biological Sciences , 1966 .

[28]  R. G. Petersen.  Matrix algebra for the biological sciences , 1966 .

[29]  M. W. Birch.  Maximum Likelihood in Three-Way Contingency Tables , 1963 .

[30]  J. Darroch.  Interactions in Multi‐Factor Contingency Tables , 1962 .

[31]  W. G. Cochran.  The Omission or Addition of an Independent Variate in Multiple Linear Regression , 1938 .