Warning

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

general_random_intersection_graph

general_random_intersection_graph(n, m, p)

Return 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 : int, optional

Seed for random number generator (default=None).

See also

gnp_random_graph, uniform_random_intersection_graph

References

[R300]

Nikoletseas, S. E., Raptopoulos, C., and Spirakis, P. G. The existence and efficient construction of large independent sets in general random intersection graphs. In ICALP (2004), J. D´ıaz, J. Karhum¨aki, A. Lepist¨o, and D. Sannella, Eds., vol. 3142 of Lecture Notes in Computer Science, Springer, pp. 1029–1040.