Markov equivalence for ancestral graphs

DOI10.1214/08-AOS626zbMath1178.68574arXiv0908.3605OpenAlexW1999463674MaRDI QIDQ834365

Thomas S. Richardson, Peter Spirtes, R. Ayesha Ali

Publication date: 19 August 2009

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

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

zbMATH Keywords

polynomial-time algorithmdirected acyclic graphsdiscriminating pathinducing pathMarkov equivalence

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Structural characterization of families of graphs (05C75)

Related Items

Searching multiregression dynamic models of resting-state fMRI networks using integer programming, Markov equivalence for ancestral graphs, On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias, Unnamed Item, Markov equivalence of marginalized local independence graphs, Estimating bounds on causal effects in high-dimensional and possibly confounded systems, Nested Markov properties for acyclic directed mixed graphs, Graphical modeling of stochastic processes driven by correlated noise, Sequences of regressions and their independences, Comments on: Sequences of regressions and their independencies, Causal Structural Learning via Local Graphs, Sound and complete causal identification with latent variables given local background knowledge, Characterization of causal ancestral graphs for time series with latent confounders, Learning high-dimensional directed acyclic graphs with latent and selection variables, Learning Minimal Latent Directed Information Polytrees, Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs, A focused information criterion for graphical models, Robust Causal Structure Learning with Some Hidden Variables, Faithfulness of Probability Distributions and Graphs, On the causal interpretation of acyclic mixed graphs under multivariate normality, Logic of causal inference from data under presence of latent confounders, A generalized back-door criterion

Uses Software

• TETRAD

Cites Work

• Markov equivalence for ancestral graphs
• Conditional independence for statistical operations
• Causation, prediction, and search
• A characterization of Markov equivalence classes for acyclic digraphs
• Ancestral graph Markov models.
• Marginalizing and conditioning in graphical models
• Conditional independence models for seemingly unrelated regressions with incomplete data
• On the Markov equivalence of maximal ancestral graphs
• Multimodality of the likelihood in the bivariate seemingly unrelated regressions model
• An Efficient Method of Estimating Seemingly Unrelated Regressions and Tests for Aggregation Bias
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item