Figure 10

Properties of the book graphs. Scatterplots of relative size of the greatest connected component ($S_{\mathit{gcc}}/|A(b)|$), relative number of connected components ($N_{\mathit{cc}}/|A(b)|$), and clustering coefficient (C) vs. number of nodes in the $G(b)$ graph. For each graph, values for an Erdős-Rényi graph with the same number of nodes and edges are reported, as well as for a subgraph of $|A(b)|$ randomly chosen nodes in the aNobii social graph.