On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

DOI10.1111/1467-9469.T01-1-00050zbMATH Open0918.60050OpenAlexW4240430580MaRDI QIDQ4221805FDOQ4221805

Authors: David Madigan, Michael D. Perlman, Steen A. Andersson 

Publication date: 17 August 1999

Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1467-9469.t01-1-00050

Recommendations

• On equivalence of Markov properties over undirected graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• A characterization of Markov equivalence for directed cyclic graphs
• Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
• Publication:3198595
• Markov Properties for Acyclic Directed Mixed Graphs

zbMATH Keywords

graphical modeldecomposable graphconditional independence of random variables

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Structural characterization of families of graphs (05C75)

Cited In (35)

• On Block Ordering of Variables in Graphical Modelling
• A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
• Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways
• Unifying Markov properties for graphical models
• Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
• Two operations of merging and splitting components in a chain graph
• Markov equivalence for ancestral graphs
• Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
• Title not available (Why is that?)
• Parametrizations and reference priors for multinomial decomposable graphical models
• Markovian acyclic directed mixed graphs for discrete data
• Discrete chain graph models
• A reconstruction algorithm for the essential graph
• On the Markov equivalence of maximal ancestral graphs
• On chain graph models for description of conditional independence structures
• Symmetries in directed Gaussian graphical models
• Normal linear regression models with recursive graphical Markov structure
• Separation and completeness properties for AMP chain graph Markov models.
• Markov equivalence in Bayesian networks
• A bridge between invariant theory and maximum likelihood estimation
• A scoring criterion for learning chain graphs
• A SINful approach to Gaussian graphical model selection
• Markov equivalence of marginalized local independence graphs
• Standard imsets for undirected and chain graphical models
• Structural Markov graph laws for Bayesian model uncertainty
• Objective Bayes factors for Gaussian directed acyclic graphical models
• On equivalence of Markov properties over undirected graphs
• Characterizing Markov equivalence classes for AMP chain graph models
• Characteristic imsets for learning Bayesian network structure
• Graphical models for multivariate Markov chains
• Graphical Markov models for infinitely many variables
• Markov properties for mixed graphs
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• A graphical characterization of the largest chain graphs
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

This page was built for publication: On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221805)