On the Markov equivalence of maximal ancestral graphs

zbMATH Open1092.05066MaRDI QIDQ2574688FDOQ2574688

Authors: Hui Zhao, Zhongguo Zheng, Baijun Liu 

Publication date: 30 November 2005

Published in: Science in China. Series A (Search for Journal in Brave)

Recommendations

• Markov equivalence for ancestral graphs
• Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Ancestral graph Markov models.
• Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
• On equivalence of Markov properties over undirected graphs

zbMATH Keywords

minimal collider path

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Neural nets and related approaches to inference from stochastic processes (62M45) Combinatorial probability (60C05) Graph theory (05C99)

Cited In (8)

• Sound and complete causal identification with latent variables given local background knowledge
• Ancestral graph Markov models.
• On the causal interpretation of acyclic mixed graphs under multivariate normality
• Markov equivalence for ancestral graphs
• Markov equivalence in Bayesian networks
• Markov equivalence of marginalized local independence graphs
• Sequences of regressions and their independences
• On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias

This page was built for publication: On the Markov equivalence of maximal ancestral graphs

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