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

DOI10.1111/1467-9469.t01-1-00050zbMath0918.60050OpenAlexW4240430580MaRDI QIDQ4221805

Michael D. Perlman, David Madigan, Steen Arne 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

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)

Related Items (19)

Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach ⋮ Characteristic imsets for learning Bayesian network structure ⋮ Symmetries in directed Gaussian graphical models ⋮ Unnamed Item ⋮ CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS ⋮ A SINful approach to Gaussian graphical model selection ⋮ A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data ⋮ A reconstruction algorithm for the essential graph ⋮ Characterizing Markov equivalence classes for AMP chain graph models ⋮ A scoring criterion for learning chain graphs ⋮ Structural Markov graph laws for Bayesian model uncertainty ⋮ Standard imsets for undirected and chain graphical models ⋮ Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways ⋮ On chain graph models for description of conditional independence structures ⋮ A graphical characterization of the largest chain graphs ⋮ Normal linear regression models with recursive graphical Markov structure ⋮ Parametrizations and reference priors for multinomial decomposable graphical models ⋮ Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation ⋮ Objective Bayes Factors for Gaussian Directed Acyclic Graphical Models

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