Skip to contents

Caugi Graph

caugi_graph()
Create a caugi_graph from edge expressions.

Queries

ancestors()
Get ancestors of nodes in a caugi_graph
children()
Get children of nodes in a caugi_graph
descendants()
Get descendants of nodes in a caugi_graph
edge_types()
Get the edge types of a caugi_graph.
edges() E()
Get edges of a caugi_graph.
exogenous()
Get all exogenous nodes in a caugi_graph
is_acyclic()
Is the caugi acyclic?
is_caugi()
Is it a caugi graph?
is_cpdag()
Is the caugi graph a CPDAG?
is_dag()
Is the caugi graph a DAG?
is_empty_caugi()
Is the caugi graph empty?
is_pdag()
Is the caugi graph a PDAG?
markov_blanket()
Get Markov blanket of nodes in a caugi_graph
neighbors() neighbours()
Get neighbors of nodes in a caugi_graph
nodes() vertices() V()
Get nodes or edges of a caugi_graph
parents()
Get parents of nodes in a caugi_graph
same_nodes()
Same nodes?
subgraph()
Get the induced subgraph

Verbs

build()
Build the graph now
add_edges() remove_edges() set_edges() add_nodes() remove_nodes()
Manipulate nodes and edges of a caugi_graph

Adjustment and d-separation

adjustment_set()
Compute an adjustment set
all_backdoor_sets()
Get all backdoor sets up to a certain size.
d_separated()
Are X and Y d-separated given Z?
is_valid_backdoor()
Is a backdoor set valid?

Simulation

generate_graph()
Generate a caugi_graph using Erdős-Rényi.

Metrics

aid()
Adjustment Identification Distance
hd()
Hamming Distance
shd()
Structural Hamming Distance

Edge Registry

register_caugi_edge()
Register a new edge type in the global registry.
caugi_registry() reset_caugi_registry() seal_caugi_registry()
caugi edge registry

Methods

length
Length of a caugi_graph
print
Print a caugi_graph

Conversions

as_adjacency()
Convert a caugi_graph to an adjacency matrix
as_bnlearn()
Convert a caugi_graph to a bnlearn network
as_caugi()
Convert to a caugi_graph
as_dagitty()
Convert a caugi_graph to a dagitty graph
as_igraph()
Convert a caugi_graph to an igraph object