Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework

DOI10.1016/j.artint.2018.12.006zbMath1478.68374arXiv1803.00116OpenAlexW2790098524WikidataQ128616644 ScholiaQ128616644MaRDI QIDQ2321275

Johannes Textor, Maciej Liśkiewicz, Benito van der Zander

Publication date: 28 August 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

complexityknowledge representationBayesian networkcausal inferencecovariate adjustmentm-separationd-separationancestral graphs

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probabilistic graphical models (62H22)

Related Items (3)

Influence control method on directed weighted signed graphs with deterministic causality ⋮ Corrigendum to: ``Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms

Uses Software

• R
• pcalg
• causaleffect
• TETRAD
• dagitty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• Causation, prediction, and search
• Ancestral graph Markov models.
• A generalized back-door criterion
• Emergence of Scaling in Random Networks
• Causal diagrams for empirical research
• Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs
• Robust Inference on Population Indirect Causal Effects: The Generalized Front Door Criterion
• Collective dynamics of ‘small-world’ networks
• Max flows in O(nm) time, or better

This page was built for publication: Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework