Construction of minimal \(d\)-separators in a dependency system

DOI10.1007/s10559-009-9136-yzbMath1216.05045OpenAlexW1996786815MaRDI QIDQ844349

A. S. Balabanov

Publication date: 19 January 2010

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9136-y

zbMATH Keywords

chainconditional independenceBayesian networkacyclic digraphcollider\(d\)-separation criterioncausal faithfulnessDAG modelfinding a locally minimal separatoridentification of edges of a modellocally minimal separatorprobabilistic dependenceprobabilistic dependency model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Knowledge representation (68T30) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Logic of minimal separation in causal networks ⋮ Logic of causal inference from data under presence of latent confounders

Cites Work

• Minimal separators in dependency structures: properties and identification
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of minimal \(d\)-separators in a dependency system