# networkx.generators.intersection.general_random_intersection_graph¶

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

Returns a random intersection graph with independent probabilities for connections between node and attribute sets.

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 (list of floats of length m) – Probabilities for connecting nodes to each attribute

• seed (integer, random_state, or None (default)) – Indicator of random number generation state. See Randomness.

gnp_random_graph(), uniform_random_intersection_graph()