Figure 2. .

Module agreement and “proto-modules.” Schematic example for a graph with N = 8 nodes and 30 rewiring steps of the procedure for probing the existence of “proto-modules” in the initial graph and the relationship between initial and final network structure. Each simulation run starting from the same initial graph is represented by a grey color. A schematic representation of the affiliation vectors can be viewed under module partitions. Each element of the vector represents a node and its color indicates the module that it was assigned to. The probability that two nodes end up in the same module across partitions is represented by the agreement matrix, in other words, a consensus across module partitions. The agreement matrices where compared both in terms of their values (Pearson’s correlation) and their modular composition (partition overlap). See Methods for details.