causally.graph.random_graph.GaussianRandomPartition

class causally.graph.random_graph.GaussianRandomPartition(num_nodes: float, p_in: float, p_out: float, n_clusters: int, min_cluster_size: int = 2)

Generator of Gaussian Random Partition directed acyclic graphs.

Parameters:

  • num_nodes (int) – Number of nodes.

  • p_in (float) – Probability of connecting a pair of nodes in the same cluster.

  • p_out (float) – Probability of connecting a pair of nodes in different clusters.

  • n_clusters (int) – Number of clusters in the graph.

  • min_cluster_size (int, default 2) – Minimum number of nodes in each cluster.

Methods

get_random_graph()

Sample a random directed acyclic graph (DAG).