k_random_intersection_graph(n, m, k, 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)

k : float

Size of attribute set to assign to each node.

seed : integer, random_state, or None (default)

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

Returns a intersection graph with randomly chosen attribute sets for each node that are of equal size (k).

See Also

gnp_random_graph

uniform_random_intersection_graph

Examples

See :

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#49
type: <class 'function'>
Commit: