A characterization of moral transitive acyclic directed graph Markov models as labeled trees

Journal of Statistical Planning and Inference

Volumn 115, Issue 1, 2003, Pages 235-259

  Castelo, Robert ^a   Siebes, Arno ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Acyclic directed graph Markov model; Conditional independence; Decomposable Markov model; Finite distributive lattice; Graphical Markov model; Labeled tree; Lattice conditional independence Markov model; Multivariate distribution; Poset; Transitive acyclic directed graph Markov model; Tree conditional independence Markov model; Undirected graph Markov model

Indexed keywords

EID: 0038066725     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-3758(02)00143-X     Document Type: Article

References (25)

1. Andersson S. Perlman M. Lattice models for conditional independence in a multivariate normal distribution Ann. Statist. 21 1993 1318-1358
2. Andersson S. Madigan D. Perlman M. Triggs C. On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs J. Statist. Plann. Inference 48 1995 25-46
3. Andersson S. Madigan D. Perlman M. A characterization of Markov equivalence classes for acyclic digraphs Ann. Statist. 25 1997 505-541
4. Andersson S. Madigan D. Perlman M. Triggs C. A graphical characterization of lattice conditional independence models Ann. Math. Artificial Intelligence 21 1997 27-50
5. 4-free chordal graphs. Technical Report UU-CS-2001-12, Institute for Computing and Information Sciences, University of Utrecht, The Netherlands, J. Graphs Combin., in press.
6. Cox D. Wermuth N. Multivariate Dependencies-Models, Analysis and Interpretation 1996 Chapman & Hall London
7. Davey B. Priestley H. Introduction to Lattices and Order 1990 Cambridge University Press Cambridge
8. Frydenberg M. The chain graph Markov property Scand. J. Statist. 17 1990 333 353
9. Gillispie, S., Perlman, M., 2001. Enumerating Markov equivalence classes of acyclic digraph models. In: Breese, J., Kohler, D. (Eds.), Uncertainty in Artificial Intelligence, Morgan Kaufmann, Los Atlos, CA, pp. 171-177.
10. Golumbic M. Trivially perfect graphs Discrete Math. 24 1978 105-107
11. Grätzer G. General Lattice Theory 1978 Birkhäuser Basel
12. Harary F. Palmer E. Graphical Enumeration 1973 Academic Press New York
13. Harary F. Kabell J. McMorris F. Subtree acyclic digraphs Ars Combin. 34 1992 93-95
14. Hearne T. Wagner C. Minimal covers of finite sets Discrete Math. 5 1973 247 251
15. Kiiveri H. Speed T. Carlin J. Recursive causal models J. Austral. Math. Soc. Ser. A 36 1984 30-52
16. Lauritzen S. Graphical Models 1996 Oxford University Press Oxford
17. Lauritzen S. Dawid A. Larsen B. Leimer H. Independence properties of directed Markov fields Networks 20 1990 491-505
18. Pearl J. Probabilistic Reasoning in Intelligent Systems 1988 Morgan Kaufmann Los Altos, CA
19. Pearl, J., Verma, T., 1987. The logic of representing dependencies by directed graphs. In: Proceedings of the Conference of the American Association of Artificial Intelligence.
20. Verma, T., Pearl, J., 1991. Equivalence and synthesis of causal models. In: Bonissone, P., Henrion, M., Kanal, L., Lemmer, J. (Eds.), Uncertainty in Artificial Intelligence, Vol. 6. Elsevier, Amsterdam, pp. 255-268.
21. Wermuth N. Linear recursive equations, covariance selection, and path analysis J. Amer. Statist. Assoc. 75 1980 963-972
22. Whittaker J. Graphical Models in Applied Multivariate Statistics 1990 Wiley New York
23. Wolk E. The comparability graph of a tree Proc. Amer. Math. Soc. 13 1962 789 795
24. Wolk E. A note on "the comparability graph of a tree" Proc. Amer. Math. Soc. 16 1965 17-20
25. Wormald N. Counting labeled chordal graphs Graphs Combin. 1 1985 193 200