Figure 3From: Exploring community structure in biological networks with random graphsValues of (a) Assortativity, r , (b) clustering coefficient, C , and (c) path length, L in modular random graphs do not vary significantly with increasing modularity ( Q ). Each graph has n=2000 nodes, a mean degree d ¯ =10 and K=10 modules with P(s=200)=1. The data points represent the average value of 50 random graphs. Standard deviations are plotted as error bars.Back to article page