Characterizing Markov equivalence classes for AMP chain graph models

DOI10.1214/009053606000000173MaRDI QIDQ2497188zbMATH OpenOpenAlexFDO

Authors Michael D. Perlman, Steen A. Andersson

Publication date 3 August 2006

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0607037

zbMATH Keywords

graphical modelchain graphMarkov equivalenceessential graph

Mathematics Subject Classification ID

Inference from stochastic processes (62M99) Applications of graph theory (05C90) Markov processes (60J99) Neural nets and related approaches to inference from stochastic processes (62M45) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Special processes (60K99)

Abstract: Chain graphs (CG) use undirected and directed edges to represent both structural and associative dependences. Like acyclic directed graphs (ADGs), the CG associated with a statistical Markov model may not be unique, so CGs fall into Markov equivalence classes, which may be superexponentially large, leading to unidentifiability and computational inefficiency in model search and selection.Under the Andersson--Madigan--Perlman (AMP) interpretation of a CG, each Markov-equivalence class can be uniquely represented by a single CG, the AMP essential graph, that can be used for efficient inference and model search and selection. Here the graphical structure of an AMP essential graph is studied in detail. This structural information will be useful for algorithmic construction of the essential graph.

Recommendations

• scientific article; zbMATH DE number 5957357
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Alternative Markov properties for chain graphs
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• A characterization of Markov equivalence classes for acyclic digraphs

Cites work

• scientific article; zbMATH DE number 992990 (Why is no real title available?)
• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 4211299 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 4867 (Why is no real title available?)
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• Alternative Markov properties for chain graphs
• BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
• Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
• Characterizing Markov equivalence classes for AMP chain graph models
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
• On chain graph models for description of conditional independence structures
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Probabilistic Networks and Expert Systems
• Separation and completeness properties for AMP chain graph Markov models.
• The size distribution for Markov equivalence classes of acyclic digraph models.

Cited in

(21)

• Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
• AMP chain graphs: minimal separators and structure learning algorithms
• scientific article; zbMATH DE number 5957357 (Why is no real title available?)
• Chain graphs for multilevel models
• An efficient algorithm for finding the largest chain graph according to a given chain graph
• Learning marginal AMP chain graphs under faithfulness revisited
• On expressiveness of the chain graph interpretations
• Separation and completeness properties for AMP chain graph Markov models.
• Multiple testing and error control in Gaussian graphical model selection
• Sequences of regressions and their independences
• scientific article; zbMATH DE number 1894279 (Why is no real title available?)
• Factorization, inference and parameter learning in discrete AMP chain graphs
• Learning marginal AMP chain graphs under faithfulness
• On expressiveness of the AMP chain graph interpretation
• Every LWF and AMP chain graph originates from a set of causal models
• Marginal AMP chain graphs
• Characterizing Markov equivalence classes for AMP chain graph models
• Chain graph interpretations and their relations revisited
• Learning AMP chain graphs and some marginal models thereof under faithfulness
• Alternative Markov properties for chain graphs
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

This page was built for publication: Characterizing Markov equivalence classes for AMP chain graph models

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