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


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 :

n : int

The number of nodes in the first bipartite set (nodes)

m : int

The number of nodes in the second bipartite set (attributes)

k : float

Size of attribute set to assign to each node.

seed : int, optional

Seed for random number generator (default=None).

See also

gnp_random_graph, uniform_random_intersection_graph


[R295]Godehardt, E., and Jaworski, J. Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics 10 (2001), 129–132.