Logic of minimal separation in causal networks

DOI10.1007/S10559-013-9499-YzbMath1307.94137OpenAlexW2034765111MaRDI QIDQ465930

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

zbMATH Keywords

Markov propertyacyclic digraphcolliderm-separationcyclic digraphidentification of edgesnon-redundant separating set

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Graphical methods in statistics (62A09)

Related Items (1)

Logic of causal inference from data under presence of latent confounders

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of minimal \(d\)-separators in a dependency system
• Minimal separators in dependency structures: properties and identification
• Ancestral graph Markov models.
• Chain Graph Models and their Causal Interpretations

This page was built for publication: Logic of minimal separation in causal networks