Fig. 3

Expected Network Portrait Divergence between an unmodified graph and a copy perturbed by edge rewiring. (left) Erdős-Rényi graph (N=300,p=3/299); (right) Barabási-Albert graph (N=300,m=3). A random rewiring is the deletion of an edge chosen uniformly at random followed by the insertion of a new edge between two nodes chosen uniformly at random. Degree-preserving rewiring chooses a pair of edges (u,v) and (x,y) and rewires them across nodes to (u,x) and (v,y) such that the degrees of the chosen nodes remain unchanged (Li et al. 2018). Errorbars denote ± 1 s.d