uniform_random_intersection_graph

uniform_random_intersection_graph(n, m, p, seed=None)

Returns a uniform random intersection graph.

Parameters:

nint

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

mint

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

pfloat

Probability of connecting nodes between bipartite sets

seedinteger, random_state, or None (default)

Indicator of random number generation state. See Randomness.

See also

gnp_random_graph

References

[1]

K.B. Singer-Cohen, Random Intersection Graphs, 1995, PhD thesis, Johns Hopkins University

[2]

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.