Figure 6From: Modularity and anti-modularity in networks with arbitrary degree distributionBipartite and k -partite graphs. (A) Bipartite graph, nodes from one group colored in red, nodes from the other group colored in black, P N /P E = 0.3, p = 0.85, q = 0.75, P D = 0.0. The graph was grown for 1,000 iterations of the algorithm, with undirected edges. (B) Graph grown with the same parameters as (A), but for k = 4.Back to article page