eval.paths: Evaluate potentially biasing paths in a DAG.

Description Usage Arguments Details Value Author(s) References See Also Examples

Description

This essentially implements the graphical algorithm described in Greenland (1999) to identify open "backdoor" (or not strictly backdoor, but potentially biasing) paths in a DAG. Paths are identified as being 'open', 'blocked by collider', or 'blocked by adjustment'. If both latter conditions apply, 'blocked by collider' is returned.

Usage

1

Arguments

dag

A DAG to which find.paths has already been applied
(e.g. within dag.adjust).

Details

This function identifies a collider-blocked path as 'blocked by collider' even if it has been unblocked by adjusting for the collider. One could argue that this should not be the case. However, the biasing seems to be sufficiently represented in the DAG by the introduction of the association "jumping" the collider and potentially opening biasing paths.

Value

A DAG with component path.status added.

Author(s)

Lutz P Breitling <lutz.breitling@gmail.com>

References

Breitling LP (2010). dagR: a suite of R functions for directed acyclic graphs. Epidemiology 21(4):586-587.
Greenland S, Pearl J, Robins JM (1999). Causal diagrams for epidemiologic research. Epidemiology 10(1):37-48.

See Also

dag.adjust, find.paths

Examples

1
2
3
4
5
6
7
8
dag1<-demo.dag1();
dag1a<-dag.adjustment(dag1, A=3); # normally called via dag.adjust();
dag1f<-find.paths(dag1a);
dag1e<-eval.paths(dag1f);
names(dag1);
names(dag1a);
names(dag1f);
names(dag1e);


Search within the dagR package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.