Characterizing Markov equivalence classes for AMP chain graph models

Annals of Statistics

Volumn 34, Issue 2, 2006, Pages 939-972

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

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Chain graph; Essential graph; Graphical model; Markov equivalence

Indexed keywords

EID: 33745294064     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/009053606000000173     Document Type: Article

References (29)

1. ANDERSSON, S. A., MADIGAN, D. and PERLMAN, M. D. (1996). An alternative Markov property for chain graphs. In Uncertainty in Artificial Intelligence: Proc. Twelfth Conference (F. Jensen and E. Horvitz, eds.) 40-48. Morgan Kaufmann, San Francisco. MR1617123
2. ANDERSSON, S. A., MADIGAN, D. and PERLMAN, M. D. (1997). On the Markov equivalence of chain graphs, undirected graphs and acyclic digraphs. Scand. J. Statist. 24 81-102. MR1436624
3. ANDERSSON, S. A., MADIGAN, D. and PERLMAN, M. D. (1997). A characterization of Markov equivalence classes for acyclic digraphs. Ann. Statist. 25 505-541. MR1439312
4. ANDERSSON, S. A., MADIGAN, D. and PERLMAN, M. D. (2001). Alternative Markov properties for chain graphs. Scand. J. Statist. 28 33-85. MR1844349
5. ANDERSSON, S. A. and PERLMAN, M. D. (2004). Characterizing Markov equivalence classes for AMP chain graph models. Technical Report 453, Dept. Statistics, Univ. Washington. Available at www.stat.washington.edu/www/research/ reports/2004/tr453.pdf.
6. ANDERSSON, S. A. and PERLMAN, M. D. (2005). On the structure of essential graphs for AMP chain graph models. To appear.
7. BLAIR, J. R. S. and PEYTON, B. (1993). An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation (A. George, J. R. Gilbert and J. W. H. Liu, eds.) 1-29. Springer, New York. MR1320296
8. BOUCKAERT, R. R. and STUDENÝ, M. (1995). Chain graphs: Semantics and expressiveness. Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Lecture Notes in Artificial Intelligence 946 69-76. Springer, Berlin. MR1464966
9. BUNTINE, W. L. (1995). Chain graphs for learning. In Uncertainty in Artificial Intelligence: Proc. Eleventh Conference (P. Besnard and S. Hanks, eds.) 46-54. Morgan Kaufmann, San Francisco. MR1615011
10. CASTELO, R. and PERLMAN, M. D. (2004). Learning essential graph Markov models from data. In Advances in Bayesian Networks (J. A. Gámez, S. Moral and A. Salmerón, eds.) 255-269. Springer, Berlin. MR2090887
11. COWELL, R. G., DAWID, A. P., LAURITZEN, S. L. and SPIEGELHALTER, D. J. (1999). Probabilistic Networks and Expert Systems. Springer, New York. MR1697175
12. COX, D. R. (1999). Graphical Markov models: Statistical motivation. Paper presented at the Workshop on Conditional Independence Structures and Graphical Models, Fields Institute for Research in Mathematical Sciences, Toronto, Canada.
13. COX, D. R. and WERMUTH, N. (1996). Multivariate Dependencies: Models, Analysis and Interpretation. Chapman and Hall, London. MR1456990
14. DRTON, M. and EICHLER, M. (2006). Maximum likelihood estimation in Gaussian chain graph models under the alternative Markov property. Scand. J. Statist. 33 247-258.
15. FRYDENBERG, M. (1990). The chain graph Markov property. Scand. J. Statist. 17 333-353. MR1096723
16. GILLISPIE, S. and PERLMAN, M. D. (2002). The size distribution for Markov equivalence classes of acyclic digraph models. Artificial Intelligence 141 137-155. MR1935281
17. HØJSGAARD, S. and THIESSON, B. (1995). BIFROST-Block recursive models induced from relevant knowledge, observations and statistical techniques. Comput. Statist. Data Anal. 19 155-175.
18. LAURITZEN, S. L. (1996). Graphical Models. Oxford Univ. Press. MR1419991
19. LAURITZEN, S. L. and WERMUTH, N. (1989). Graphical models for associations between variables, some of which are qualitative and some quantitative. Ann. Statist. 17 31-57. MR0981437
20. LEVITZ, M., PERLMAN, M. D. and MADIGAN, D. (2001). Separation and completeness properties for AMP chain graph Markov models. Ann. Statist. 29 1751-1784. MR1891745
21. MADIGAN, D., ANDERSSON, S. A., PERLMAN, M. D. and VOLINSKY, C. T. (1996). Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Comm. Statist. - Theory Methods 25 2493-2519.
22. ROVERATO, A. (2005). A unified approach to the characterization of equivalence classes of DAGs, chain graphs with no flags and chain graphs. Scand. J. Statist. 32 295-312. MR2188675
23. STUDENÝ, M. (1996). On separation criterion and recovery algorithm for chain graphs. In Uncertainty in Artificial Intelligence: Proc. Twelfth Conference (F. Jensen and E. Horvitz, eds.) 509-516. Morgan Kaufmann, San Francisco. MR1617229
24. STUDENÝ, M. (1997). A recovery algorithm for chain graphs. Internat. J. Approx. Reason. 17 265-293. MR1462716
25. STUDENÝ, M. (1998). Bayesian networks from the point of view of chain graphs. In Uncertainty in Artificial Intelligence: Proc. Fourteenth Conference (G. F. Cooper and S. Moral, eds.) 496-503. Morgan Kaufmann, San Francisco.
26. STUDENT, M. and BOUCKAERT, R. R. (1998). On chain graph models for description of conditional independence structure. Ann. Statist. 26 1434-1495. MR1647685
27. VOLF, M. and STUDENÝ, M. (1999). A graphical characterization of the largest chain graphs. Internat. J. Approx. Reason. 20 209-236. MR1685080
28. WERMUTH, N. and 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. MR1049302
29. WHITTAKER, J. (1990). Graphical Models in Applied Multivariate Statistics. Wiley, Chichester. MR1112133