Alternative Markov properties for chain graphs

Scandinavian Journal of Statistics

Volumn 28, Issue 1, 2001, Pages 33-85

  Andersson, Steen A ^a   Madigan, David ^b   Perlman, Michael D ^b  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Block recursive normal linear system; Chain graph; Graphical markov model; Markov equivalence; Markov properties

Indexed keywords

EID: 0035285942     PISSN: 03036898     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9469.00224     Document Type: Article

References (41)

1. Andersson, S. A. & Perlman, M. D. (1998). Normal linear regression models with recursive graphical Markov structure. J. Multivariate Anal. 66, 133-187.
2. Andersson, S. A., Madigan, D. & Perlman, M. D. (1996). An alternative Markov property for chain graphs. Uncertainty in artificial intelligence: proceedings of the twelfth conference (eds F. Jensen and E. Horvitz), 40-48. Morgan Kaufmann, San Francisco.
3. Andersson, S. A., Madigan, D. & Perlman, M. D. (1997a). On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphs. Scand. J. Statist. 24, 81-102.
4. Andersson, S. A., Madigan, D. & Perlman, M. D. (1997b). A characterization of Markov equivalence classes for acyclic digraphs. Ann. Statist. 25, 505-541.
5. Bouckaert, R. & Studený, M. (1995). Chain graphs: semantics and expressiveness. In Symbolic and qualitative approaches to reasoning and uncertainty (eds Ch. Froidevaux and J. Kohlas), 69-76. Springer-Verlag, Berlin.
6. Buntine, W. L. (1995). Chain graphs for learning. Uncertainty in artificial intelligence: proceedings of the eleventh conference (eds P. Besnard and S. Hanks), 46-54. Morgan Kaufmann, San Francisco.
7. Chickering, D. M. (1995). A transformational characterization of equivalent Bayesian network structures. In Uncertainty in artificial intelligence: proceedings of the eleventh conference (eds P. Besnard and S. Hanks), 87-98. Morgan Kaufman, San Francisco.
8. Cox, D. R. (1993). Causality and graphical models. Bull. Internat. Statist. Inst., Proc. 49th Session, 1, 363-372.
9. Cox, D. R. & Wermuth, N. (1993). Linear dependencies represented by chain graphs (with discussion). Statist. Sci. 8, 204-218; 241-217.
10. Cox, D. R. & Wermuth, N. (1996). Multivariate dependencies: models, analysis, and interpretation. Chapman & Hall, London.
11. Dawid, A. P. (1980). Conditional independence for statistical operations. Ann. Statist. 8, 598-617.
12. Dawid, A. P. & Lauritzen, S. L. (1993). Hyper Markov laws in the statistical analysis of decomposable graphical models. Ann. Statist. 21, 1272-1317.
13. Dempster, A. P. (1972). Covariance selection. Biometrics 28, 157-175.
14. Edwards, D. (1995). Introduction to graphical modelling. Springer, New York.
15. Frydenberg, M. (1990). The chain graph Markov property. Scand. J. Statist. 17, 333-353.
16. Geiger, D. & Pearl, J. (1988). On the logic of influence diagrams. In Proceedings of the 4th workshop on uncertainty in artificial intelligence (eds R. Shachter, T. Levitt, L. Kanal and J. Lemmer), 136-147. North-Holland, Amsterdam.
17. Højsgaard, S. & Thiesson, B. (1995). BIFROST - Block recursive models induced from relevant knowledge, observations, and statistical techniques. Comput. Statist. Data Anal. 19, 155-175.
18. Kauermann, G. (1996). On a dualization of graphical Gaussian models. Scand. J. Statist. 23, 105-116.
19. Koster, J. T. A. (1996). Markov properties of non-recursive causal models. Ann. Statist. 24, 2148-2177.
20. Lauritzen, S. L. (1996). Graphical models. Oxford University Press, Oxford.
21. Lauritzen, S. L. & Spiegelhalter, D. J. (1988). Local computations with probabilities on graphical structures and their application to expert systems (with discussion). J. Roy. Statist. Soc. Ser. B 50, 157-224.
22. Lauritzen, S. L. & Wermuth, N. (1989). Graphical models for association between variables, some of which are qualitative and some quantitative. Ann. Statist. 17, 31-57.
23. Lauritzen, S. L., Speed, T. P. & Vijayan, K. (1984). Decomposable graphs and hypergraphs. J. Austral. Math. Soc. Ser. A 36, 12-29.
24. Lauritzen, S. L., Dawid, A. P., Larsen, B. N. & Leimer, H.-G. (1990). Independence properties of directed Markov fields. Networks 20, 491-505.
25. Levitz, M., Perlman, M. D. & Madigan, D. (2000). Separation submitted and completeness properties for AMP chain graph Markov models.
26. Madigan, D., Andersson, S. A., Perlman, M. D. & Volinsky, C. M. (1996). Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Commun. Statist. Theory Methods 25, 2493-2519.
27. Matús, F. (1992). On equivalence of Markov properties over undirected graphs. J. Appl. Probab. 29, 745-749.
28. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Mateo.
29. Pearl, J. & Verma, T. (1991). A theory of inferred causation. In Proceedings of the second international conference on principles of knowledge representation (eds J. Allen, R. Fikes, E. Sandewall), 441-452. Morgan Kaufmann, San Francisco.
30. Shachter, R. D. & Kenley, C. R. (1989). Gaussian influence diagrams. Management Sci. 35, 527-550.
31. Spiegelhalter, D. J., Dawid, A. P., Lauritzen, S. L & Cowell, R. G. (1993). Bayesian analysis in expert systems (with discussion). Statist. Sci. 8, 219-283.
32. Spirtes, P. (1995). Directed cyclic graphical representation of feedback models. In Uncertainty in artificial intelligence: proceedings of the eleventh conference (eds P. Besnard and S. Hanks), 491-498. Morgan Kaufmann, San Francisco.
33. Spirtes, P., Glymour, C. & Scheines, R. (1993). Causation, prediction, and search. Springer-Verlag, New York.
34. Studený, M. (1996). On separation criterion and recovery algorithm for chain graphs. In Uncertainty in artificial intelligence: proceedings of the twelfth conference (eds F. Jensen and E. Horvitz), 509-516. Morgan Kaufmann, San Francisco.
35. Studený, M. (1997). A recovery algorithm for chain graphs. Internat. J. Approximate Reasoning 17, 265-293.
36. Studený, M. & Bouckaert, R. R. (1998). On chain graph models for description of conditional independence structure. Ann. Statist. 26, 1434-1495.
37. Verma, T. & Pearl, J. (1992). An algorithm for deciding if a set of observed independencies has a causal explanation. In Uncertainty in artificial intelligence: proceedings of the eighth conference (eds D. Dubois, M. Wellman, B. D'Ambrosio, P. Smets), 323-330. Morgan Kaufman, San Francisco.
38. Wermuth, N. & Lauritzen, S. L. (1983). Graphical and recursive models for contingency tables. Biometrika 70, 537-552
39. Wermuth, N. & Lauritzen, S. L. (1990). On substantive research hypotheses, conditional independence graphs, and graphical chain models (with discussion). J. Roy. Statist. Soc. Ser. B 52, 21-72.
40. Whittaker, J. L. (1990). Graphical models in applied multivariate statistics. Wiley, New York.
41. Zellner, A. (1962). An efficient method of estimating seemingly unrelated regression equations and tests for aggregation bias. J. Amer. Statist. Assoc. 57, 348-368.