This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
general_random_intersection_graph(n, m, p)¶
Return a random intersection graph with independent probabilities for connections between node and attribute sets.
 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.