causally.graph.random_graph.BarabasiAlbert.get_random_graph

BarabasiAlbert.get_random_graph() → array

Sample a random directed acyclic graph (DAG).

Returns:

A – Adjacency matrix representation of the output DAG. The presence of a directed edge from node i to node j is denoted by A[i, j] = 1. Absence of the edge is denote by A[i, j] = 0.

Return type:

np.array