Logic of minimal separation in causal networks
DOI10.1007/S10559-013-9499-YzbMATH Open1307.94137OpenAlexW2034765111MaRDI QIDQ465930FDOQ465930
Authors: O. S. Balabanov 
Publication date: 24 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-013-9499-y
Recommendations
acyclic digraphcolliderMarkov propertym-separationcyclic digraphidentification of edgesnon-redundant separating set
Graphical methods in statistics (62A09) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- Ancestral graph Markov models.
- Chain Graph Models and their Causal Interpretations
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Minimal separators in dependency structures: properties and identification
- Title not available (Why is that?)
- Construction of minimal \(d\)-separators in a dependency system
Cited In (9)
- Logic of causal inference from data under presence of latent confounders
- Causality, conditional independence, and graphical separation in settable systems
- Causal discovery from Markov properties under latent confounders
- Logic of multicomponent systems and a combinatorial model of causal relationships
- Minimal sufficient causation and directed acyclic graphs
- Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
- Construction of minimal \(d\)-separators in a dependency system
- Minimal separators in dependency structures: properties and identification
- Corrigendum to: ``Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
Uses Software
This page was built for publication: Logic of minimal separation in causal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465930)
