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

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 : integer, random_state, or None (default)

Indicator of random number generation state. See Randomness<randomness> .

Returns a uniform random intersection graph.

See Also

gnp_random_graph

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.generators.intersection.general_random_intersection_graph networkx.generators.intersection.k_random_intersection_graph

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/generators/intersection.py#14
type: <class 'function'>
Commit: