A characterization of Markov equivalence classes for acyclic digraphs

DOI10.1214/AOS/1031833662zbMATH Open0876.60095OpenAlexW2111061246MaRDI QIDQ1359411

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

Publication date: 18 November 1997

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

Full work available at URL: https://doi.org/10.1214/aos/1031833662

zbMATH Keywords

model selectionacyclic digraphgraphical Markov modelMarkov equivalenceessential graph

Mathematics Subject Classification ID

Inference from stochastic processes (62M99) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Special processes (60K99) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Graphical models for associations between variables, some of which are qualitative and some quantitative
• A Bayesian method for the induction of probabilistic networks from data
• Hyper Markov laws in the statistical analysis of decomposable graphical models
• Bayesian analysis in expert systems. With comments and a rejoinder by the authors
• Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
• Sequential updating of conditional probabilities on directed graphical structures
• Decomposition of maximum likelihood in mixed graphical interaction models
• Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
• Bayesian Graphical Models for Discrete Data
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• Markov fields and log-linear interaction models for contingency tables
• A graphical characterization of lattice conditional independence models
• On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
• Normal linear regression models with recursive graphical Markov structure
• Birth Defects Registered by Double Sampling: A Bayesian Approach Incorporating Covariates and Model Uncertainty
• Independence properties of directed markov fields
• The analysis of multidimensional contingency tables when some variables are posterior to others: a modified path analysis approach
• Collapsibility and response variables in contingency tables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (93)

• Bayesian learning of multiple directed networks from observational data
• Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
• The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks
• A survey on causal discovery: theory and practice
• Title not available (Why is that?)
• Compatible priors for model selection of high-dimensional Gaussian DAGs
• The Characteristic Imset Polytope of Bayesian Networks with Ordered Nodes
• Title not available (Why is that?)
• Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
• Causality and causal models: a conceptual perspective
• Bayesian sample size determination for causal discovery
• Toric ideals of characteristic imsets via quasi-independence gluing
• A local method for identifying causal relations under Markov equivalence
• Uniform random generation of large acyclic digraphs
• Equivalence class selection of categorical graphical models
• Discussion to: Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F.C. Stingo
• Greedy Causal Discovery Is Geometric
• Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
• Corrected score methods for estimating Bayesian networks with error-prone nodes
• Robust Causal Structure Learning with Some Hidden Variables
• Bayesian causal inference in probit graphical models
• An efficient algorithm for counting Markov equivalent DAGs
• A generalized back-door criterion
• Fast causal orientation learning in directed acyclic graphs
• An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm
• Bayesian optimal experimental design for inferring causal structure
• Structural Markov graph laws for Bayesian model uncertainty
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Title not available (Why is that?)
• Efficient Sampling and Structure Learning of Bayesian Networks
• On Block Ordering of Variables in Graphical Modelling
• A general framework for enumerating equivalence classes of solutions
• Two optimal strategies for active learning of causal models from interventional data
• A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Tests for differential Gaussian Bayesian networks based on quadratic inference functions
• High-dimensional consistency in score-based and hybrid structure learning
• Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways
• Causal statistical inference in high dimensions
• Equivalence classes of staged trees
• Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
• Ancestral graph Markov models.
• Generalized Permutohedra from Probabilistic Graphical Models
• Characterization of inclusion neighbourhood in terms of the essential graph
• A geometric view on learning Bayesian network structures
• Markov equivalence for ancestral graphs
• Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
• The size distribution for Markov equivalence classes of acyclic digraph models.
• On open questions in the geometric approach to structural learning Bayesian nets
• Bayesian graphical models for modern biological applications
• Counting Markov equivalence classes for DAG models on trees
• High-dimensional joint estimation of multiple directed Gaussian graphical models
• A new prior for discrete DAG models with a restricted set of directions
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Causal discovery through MAP selection of stratified chain event graphs
• Inference of causal structure using the unobservable
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Structural learning for Bayesian networks by testing complete separators in prime blocks
• Formulas for counting acyclic digraph Markov equivalence classes
• A reconstruction algorithm for the essential graph
• An application of formal argumentation: fusing Bayesian networks in multi-agent systems
• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
• On chain graph models for description of conditional independence structures
• Learning marginal AMP chain graphs under faithfulness revisited
• Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
• Normal linear regression models with recursive graphical Markov structure
• Discovery of statistical equivalence classes using computer algebra
• Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
• Bayesian networks and information theory for audio-visual perception modeling
• Multiple testing and error control in Gaussian graphical model selection
• \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
• A recovery algorithm for chain graphs
• Foundations of compositional models: structural properties
• Structural learning and estimation of joint causal effects among network-dependent variables
• A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
• Structural Intervention Distance for Evaluating Causal Graphs
• On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
• Title not available (Why is that?)
• Characterizing Markov equivalence classes for AMP chain graph models
• Asymptotic enumeration of extensional acyclic digraphs
• Characteristic imsets for learning Bayesian network structure
• Chain graph interpretations and their relations revisited
• Chain Graph Models and their Causal Interpretations
• Gaussian Bayesian network comparisons with graph ordering unknown
• Markov properties for mixed graphs
• Bayesian inference of causal effects from observational data in Gaussian graphical models
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Sparse graphical models for exploring gene expression data
• Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
• Learning local directed acyclic graphs based on multivariate time series data
• Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
• Efficient local updates for undirected graphical models
• Causal inference in partially linear structural equation models

This page was built for publication: A characterization of Markov equivalence classes for acyclic digraphs

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