Alternative Markov properties for chain graphs

被引:98
作者
Andersson, SA
Madigan, D
Perlman, MD [1 ]
机构
[1] Univ Washington, Dept Stat, Seattle, WA 98195 USA
[2] Indiana Univ, Bloomington, IN 47405 USA
关键词
D O I
10.1111/1467-9469.00224
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Graphical Markov models use graphs to represent possible dependences among statistical variables. Lauritzen, Wermuth, and Frydenberg (LWF) introduced a Markov property for chain graphs (CG): graphs that can be used to represent both structural and associative dependences simultaneously and that include both undirected graphs (UG) and acyclic directed graphs (ADG) as special cases. Here an alternative Markov property (AMP) for CGs is introduced and shown to be the Markov property satisfied by a block-recursive linear system with multivariate normal errors. This model can be decomposed into a collection of conditional normal models, each of which combines the features of multivariate linear regression models and covariance selection models, facilitating the estimation of its parameters. In the general case, necessary and sufficient conditions are given for the equivalence of the LWF and AMP Markov properties of a CG, for the AMP Markov equivalence of two CGs, for the AMP Markov equivalence of a CG to some ADG or decomposable UG, and for other equivalences. For CGs, in some ways the AMP property is a more direct extension of the ADG Markov property than is the LWP property.
引用
收藏
页码:33 / 85
页数:53
相关论文
共 40 条
  • [21] LAURITZEN SL, 1988, J ROY STAT SOC B MET, V50, P157
  • [22] INDEPENDENCE PROPERTIES OF DIRECTED MARKOV-FIELDS
    LAURITZEN, SL
    DAWID, AP
    LARSEN, BN
    LEIMER, HG
    [J]. NETWORKS, 1990, 20 (05) : 491 - 505
  • [23] GRAPHICAL MODELS FOR ASSOCIATIONS BETWEEN VARIABLES, SOME OF WHICH ARE QUALITATIVE AND SOME QUANTITATIVE
    LAURITZEN, SL
    WERMUTH, N
    [J]. ANNALS OF STATISTICS, 1989, 17 (01) : 31 - 57
  • [24] LEVITZ M, 2000, SEPARATION SUBMITTED
  • [25] Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs
    Madigan, D
    Andersson, SA
    Perlman, MD
    Volinsky, CT
    [J]. COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1996, 25 (11) : 2493 - 2519
  • [26] ON EQUIVALENCE OF MARKOV PROPERTIES OVER UNDIRECTED GRAPHS
    MATUS, F
    [J]. JOURNAL OF APPLIED PROBABILITY, 1992, 29 (03) : 745 - 749
  • [27] PEARL J, 1991, PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, P441
  • [28] Pearl P, 1988, PROBABILISTIC REASON, DOI DOI 10.1016/C2009-0-27609-4
  • [29] GAUSSIAN INFLUENCE DIAGRAMS
    SHACHTER, RD
    KENLEY, CR
    [J]. MANAGEMENT SCIENCE, 1989, 35 (05) : 527 - 550
  • [30] BAYESIAN-ANALYSIS IN EXPERT-SYSTEMS
    SPIEGELHALTER, DJ
    DAWID, AP
    LAURITZEN, SL
    COWELL, RG
    [J]. STATISTICAL SCIENCE, 1993, 8 (03) : 219 - 247