msas: Identify minimal sufficient adjustment sets.

In dagR: Directed Acyclic Graphs: Analysis and Data Simulation

Identify minimal sufficient adjustment sets.

Description

Evaluates DAG adjustment sets identified by a dag.search (or brute.search) for minimal sufficiency by counting for each sufficient adjustment set A how many smaller sufficient ones that are contained in A exist.

Usage

msas(adjSets)

Arguments

adjSets

The searchRes component of a DAG (or the output of brute.search, which is used by dag.adjust to produce searchRes).

Value

A vector containing a -1 for each insufficient adjustment set, and for sufficient ones the number of smaller sufficient ones contained in it.

Author(s)

Lutz P Breitling <[e-mail]>

References

Breitling LP (2010). dagR: a suite of R functions for directed acyclic graphs. Epidemiology 21(4):586-587.
Breitling LP, Duan C, Dragomir AD, Luta G (2022). Using dagR to identify minimal sufficient adjustment sets and to simulate data based on directed acyclic graphs. Int J Epidemiol 50(6):1772-1777.
Greenland S, Pearl J, Robins JM (1999). Causal diagrams for epidemiologic research. Epidemiology 10(1):37-48.
Knüppel S, Stang A (2010). DAG Program: identifying minimal sufficient adjustment sets. Epidemiology 21(1):159.

See Also

viv, summary.dagRdag

dagR documentation built on Oct. 9, 2022, 5:06 p.m.