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


uniform_random_intersection_graph(n, m, p, seed=None)[source]

Return a uniform random intersection graph.

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)

p : float

Probability of connecting nodes between bipartite sets

seed : int, optional

Seed for random number generator (default=None).

See also



[R296]K.B. Singer-Cohen, Random Intersection Graphs, 1995, PhD thesis, Johns Hopkins University
[R297]Fill, J. A., Scheinerman, E. R., and Singer-Cohen, K. B., Random intersection graphs when m = !(n): An equivalence theorem relating the evolution of the g(n, m, p) and g(n, p) models. Random Struct. Algorithms 16, 2 (2000), 156–176.