A characterization of Markov equivalence classes for acyclic digraphs

DOI10.1214/aos/1031833662zbMath0876.60095OpenAlexW2111061246MaRDI QIDQ1359411

Michael D. Perlman, David Madigan, Steen Arne 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 selection acyclic digraph graphical Markov model Markov equivalence essential graph

Mathematics Subject Classification ID

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

Related Items

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

Cites Work