- k_random_intersection_graph(n, m, k, seed=None)¶
Returns a intersection graph with randomly chosen attribute sets for each node that are of equal size (k).
The number of nodes in the first bipartite set (nodes)
The number of nodes in the second bipartite set (attributes)
Size of attribute set to assign to each node.
- seedinteger, random_state, or None (default)
Indicator of random number generation state. See Randomness.
Godehardt, E., and Jaworski, J. Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics 10 (2001), 129–132.