outputs the adjacency matrix of a randomly generated directed acyclic graph (DAG).
After simulating a random topological order first (the order can also be prespecified), the algorithm connects two nodes with the porbability probConnect.
number of nodes.
probability of connecting two nodes, determines the sparsity of the graph. Choosing probConnect = 2/(p-1), for example, leads to an expected number of p nodes.
OPTIONAL: causal or topological order of the nodes. If not provided, the topological order is chosen randomly.
p x p adjacency matrix that describes a directed acyclic graph (DAG) with p nodes. The entry (i,j) equals one if and only if there is an edge from i to j.
Jonas Peters <email@example.com>
randomDAG(p = 5, probConnect = 0.6)