论文信息 - The chain graph Markov property

The chain graph Markov property

A new class of graphs, chain graphs, suitable for modelling conditional independencies are introduced and their Markov properties investigated. This class of graphs, which includes the undirected and directed acyclic graphs, enables modelling recursive models with multivariate response variables. Results concerning the equivalence of different definitions of their Markov properties including a factorization of the density are shown. We give a necessary and sufficient condition for two chain graphs to have the same Markov properties

M. Frydenberg

[1] A. Dawid. Conditional Independence for Statistical Operations , 1980 .

[2] N. Wermuth. Linear Recursive Equations, Covariance Selection, and Path Analysis , 1980 .

[3] V. Isham. An Introduction to Spatial Point Processes and Markov Random Fields , 1981 .

[4] T. Speed,et al. Recursive causal models , 1984, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[5] Judea Pearl,et al. The Logic of Representing Dependencies by Directed Graphs , 1987, AAAI.

[6] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[7] Judea Pearl,et al. Causal networks: semantics and expressiveness , 2013, UAI.

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

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

[10] M. Frydenberg. Marginalization and Collapsibility in Graphical Interaction Models , 1990 .

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

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