Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
k_random_intersection_graph¶

k_random_intersection_graph
(n, m, k)[source]¶ Return a intersection graph with randomly chosen attribute sets for each node that are of equal size (k).
Parameters: See also
gnp_random_graph()
,uniform_random_intersection_graph()
References
[1] Godehardt, E., and Jaworski, J. Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics 10 (2001), 129–132.