intrinsicSets: List Intrinsic Sets of Summary Graph or ADMG

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

List Intrinsic Sets of Summary Graph or ADMG

Description

List Intrinsic Sets of a Summary Graph or Acyclic Directed Mixed Graph, possibly by district.

Usage

intrinsicSets(graph, r = TRUE, by_district = FALSE, sort = 2, recall = FALSE)

intrinsicSets2(graph, r = TRUE, by_district = FALSE, maxbarren, sort = 1)

Arguments

graph	object of class mixedgraph, must be an ADMG.
r	logical, should recursive head definition be used? Defaults to TRUE
by_district	logical, should intrinsic sets be grouped by district? Defaults to FALSE
sort	should output be sorted/unique?
recall	logical: is this a recalling of the function (internal use only)
maxbarren	Maximum number of barren nodes (i.e. head size) to consider

Details

intrinsicSets returns a list of integer vectors, each being an intrinsic set (or if by_district = TRUE a list of lists, each containing the intrinsic sets in a single district). If r = FALSE the intrinsic sets are the heads and their dis-tails.

intrinsicClosure returns an integer vector containing the closure of set.

Functions

• intrinsicSets2(): Alternative method for non-recursive heads only

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