findSep: Find separator sets

In rje42/ADMGs2: Functions for Describing and Fitting Discrete Mixed Graphs

Find separator sets

Description

Implement the algorithms of van der Zander et al. (2014) to find separator sets.

Usage

findSep(graph, X, Y, Z = integer(0), R, check = TRUE)

listSep(graph, X, Y, Z = integer(0), R, check = TRUE)

allSep(graph, X, Z = integer(0), R, check = TRUE)

whSep(graph, X, Z, check = TRUE)

Arguments

graph	a summary graph of class mixedgraph
X, Y	sets to separate
Z	set to include in conditioning set
R	maximal set to look in
check	logical: check that the sets are suitably disjoint?

Details

findSep finds a set that m-separates X and Y, that must contain vertices in Z and may contain vertices in R. listSep exhaustively lists all such sets.

allSep returns the maximal set m-separated from X by Z. whSep returns the subset of Z that is m-separated from X by the remainder of Z.

The algorithms for findSep and listSep are taken from van der Zander et al. (2014).

Functions

• listSep(): list all m-separations

• allSep(): give maximal m-separated set

• whSep(): find m-separated subset

References

van der Zander et al. Constructing Separators and Adjustment Sets in Ancestral Graphs. UAI Workshop on Causal Inference: Learning and Prediction, 2014.

rje42/ADMGs2 documentation built on Sept. 3, 2024, 7:39 p.m.