Abstract | ||
---|---|---|
Many models of dynamical systems have causal interpretations that support reasoning about the consequences of interventions, suitably defined. Furthermore, local independence has been suggested as a useful independence concept for stochastic dynamical systems. There is, however, no well-developed theoretical framework for causal learning based on this notion of independence. We study independence models induced by directed graphs (DGs) and provide abstract graphoid properties that guarantee that an independence model has the global Markov property w.r.t. a DG. We apply these results to Ito diffusions and event processes. For a partially observed system, directed mixed graphs (DMGs) represent the marginalized local independence model, and we develop, under a faithfulness assumption, a sound and complete learning algorithm of the directed mixed equivalence graph (DMEG) as a summary of all Markov equivalent DMGs. |
Year | Venue | Field |
---|---|---|
2018 | UNCERTAINTY IN ARTIFICIAL INTELLIGENCE | Graph,Mathematical optimization,Markov property,Computer science,Mixed graph,Theoretical computer science,Equivalence (measure theory),Dynamical systems theory,Local independence,Graphoid,Dynamical system |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Søren Wengel Mogensen | 1 | 0 | 0.34 |
Daniel Malinsky | 2 | 4 | 2.85 |
Niels Richard Hansen | 3 | 19 | 3.36 |