Document

planted_partition_graph(l, k, p_in, p_out, seed=None, directed=False)

This model partitions a graph with n=l*k vertices in l groups with k vertices each. Vertices of the same group are linked with a probability p_in, and vertices of different groups are linked with probability p_out.

Parameters

l : int: Number of groups
k : int: Number of vertices in each group
p_in : float: probability of connecting vertices within a group
p_out : float: probability of connected vertices between groups
seed : integer, random_state, or None (default): Indicator of random number generation state. See Randomness<randomness> .
directed : bool,optional (default=False): If True return a directed graph

Raises

NetworkXError: If p_in,p_out are not in [0,1] or

Returns

G : NetworkX Graph or DiGraph: planted l-partition graph

Returns the planted l-partition graph.

Examples

>>> G = nx.planted_partition_graph(4, 3, 0.5, 0.1, seed=42)

See :

Back References

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

networkx.generators.community.stochastic_block_model networkx.generators.community.planted_partition_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