Every LWF and AMP chain graph originates from a set of causal models
This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This implies that the independence model represented by the chain graph can be accounted for by a set of causal models that are subject to selection bias, which in turn can be accounted for by a system that switches between different regimes or configurations.
Code (0)
등록된 구현이 없습니다.
Tasks
Selection biasSimilar Papers 제목 키워드 기반
Identification of Strong Edges in AMP Chain Graphs
The essential graph is a distinguished member of a Markov equivalence class of AMP chain graphs. However, the directed edges in the essential graph are not necessarily strong or invariant, i.e. they may not be shared by …
Implicit Causal Graph Construction in Text via Chain Discovery
Causal graphs in text are typically populated by observable, predefined events. In contrast, we study implicit causal graph construction from text by treating each described cause-effect pair as the begin- and endpoint o…
Discovering Mixtures of Structural Causal Models from Time Series Data
Discovering causal relationships from time series data is significant in fields such as finance, climate science, and neuroscience. However, contemporary techniques rely on the simplifying assumption that data originates…
Causal DiscoveryTime SeriesVariational InferenceUncovering life-course patterns with causal discovery and survival analysis
We provide a novel approach and an exploratory study for modelling life event choices and occurrence from a probabilistic perspective through causal discovery and survival analysis. Our approach is formulated as a bi-lev…
Causal DiscoverySurvival AnalysisOn a hypergraph probabilistic graphical model
We propose a directed acyclic hypergraph framework for a probabilistic graphical model that we call Bayesian hypergraphs. The space of directed acyclic hypergraphs is much larger than the space of chain graphs. Hence Bay…
model