Resolution:
## Figure 8.
Example of the similarity analysis in an artificial network. The network similarity σ for an ER graph (n = 250 nodes, m = 1245 edges) and its rewired versions has been computed as a function of the randomization
depth r (number of rewired edges). In each randomization step one endpoint of an edge is rewired
to another randomly chosen node.
Müller-Linow |