Markov equivalence for ancestral graphs
From MaRDI portal
Publication:834365
DOI10.1214/08-AOS626zbMATH Open1178.68574arXiv0908.3605OpenAlexW1999463674MaRDI QIDQ834365FDOQ834365
Authors: R. Ayesha Ali, Thomas S. Richardson, Peter Spirtes 
Publication date: 19 August 2009
Published in: The Annals of Statistics (Search for Journal in Brave)
Abstract: Ancestral graphs can encode conditional independence relations that arise in directed acyclic graph (DAG) models with latent and selection variables. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We state and prove conditions under which two maximal ancestral graphs are Markov equivalent to each other, thereby extending analogous results for DAGs given by other authors. These conditions lead to an algorithm for determining Markov equivalence that runs in time that is polynomial in the number of vertices in the graph.
Full work available at URL: https://arxiv.org/abs/0908.3605
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Structural characterization of families of graphs (05C75)
Cites Work
- Causation, prediction, and search
- An Efficient Method of Estimating Seemingly Unrelated Regressions and Tests for Aggregation Bias
- A characterization of Markov equivalence classes for acyclic digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ancestral graph Markov models.
- Conditional independence for statistical operations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Marginalizing and conditioning in graphical models
- Title not available (Why is that?)
- Markov equivalence for ancestral graphs
- Title not available (Why is that?)
- Multimodality of the likelihood in the bivariate seemingly unrelated regressions model
- Conditional independence models for seemingly unrelated regressions with incomplete data
- On the Markov equivalence of maximal ancestral graphs
Cited In (26)
- Sound and complete causal identification with latent variables given local background knowledge
- Logic of causal inference from data under presence of latent confounders
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- A study of recently discovered equalities about latent tree models using inverse edges
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Ancestral graph Markov models.
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- A focused information criterion for graphical models
- Estimating bounds on causal effects in high-dimensional and possibly confounded systems
- Faithfulness of probability distributions and graphs
- Markov equivalence for ancestral graphs
- Causal Structural Learning via Local Graphs
- On the Markov equivalence of maximal ancestral graphs
- Robust Causal Structure Learning with Some Hidden Variables
- Characterization of causal ancestral graphs for time series with latent confounders
- Learning minimal latent directed information polytrees
- Title not available (Why is that?)
- Markov equivalence in Bayesian networks
- Comments on: Sequences of regressions and their independencies
- Markov equivalence of marginalized local independence graphs
- A generalized back-door criterion
- Graphical modeling of stochastic processes driven by correlated noise
- Sequences of regressions and their independences
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
- Nested Markov properties for acyclic directed mixed graphs
Uses Software
This page was built for publication: Markov equivalence for ancestral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834365)
