cliquedecom_greedy: Decomposing Null Exposure Graph Using the Greedy Algorithm

In dpuelz/CliqueRT: Randomization-Based Testing of Causal Effects under General Interference

Decomposing Null Exposure Graph Using the Greedy Algorithm

Description

Outputs a biclique decomposition of the null-exposure graph using the greedy algorithm proposed above. The resulting decomposition paritions the assignment space, while the unit space may overlap.

Usage

cliquedecom_greedy(ne, Zobs_id, num_ass, stop_at_Zobs)

Arguments

ne	The null-exposure graph
Zobs_id	The index location of the observed assignment vector in Z, Z_a, and Z_b.
num_ass	Controls the minimum number of focal assignments in the biclique found by the algorithm (algorithm runtime is sensitive to this value).
stop_at_Zobs	A Boolean indicating whether the decomposition algorithm should stop when the clique containing the observed assignment is found.

Value

If stop_at_Zobs is TRUE, a matrix representing the clique to condition upon. If stop_at_Zobs is FALSE, a list containing the clique decomposition of the null-exposure graph.

dpuelz/CliqueRT documentation built on Jan. 6, 2023, 11:20 p.m.