random_partition_graph(sizes, p_in, p_out, seed=None, directed=False)
A partition graph is a graph of communities with sizes defined by s in sizes. Nodes in the same group are connected with probability p_in and nodes of different groups are connected with probability p_out.
This is a generalization of the planted-l-partition described in . It allows for the creation of groups of any size.
The partition is store as a graph attribute 'partition'.
Sizes of groups
probability of edges with in groups
probability of edges between groups
Whether to create a directed graph
Indicator of random number generation state. See Randomness<randomness>
.
If p_in or p_out is not in [0,1]
random partition graph of size sum(gs)
Returns the random partition graph with a partition of sizes.
>>> G = nx.random_partition_graph([10, 10, 10], 0.25, 0.01)
... len(G) 30
>>> partition = G.graph["partition"]See :
... len(partition) 3
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.random_partition_graph
networkx.generators.community.gaussian_random_partition_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