Resolution:
## Figure 5.
Computation of the transition frequencies. Sketch of the procedure. In (a) the update rule is shown. For a given string of
conditional relations (BR) the associated dynamical pattern is calculated at time-step
t - 1. Next the entries of BR are mutated at time-step t and the (new) dynamical pattern is evaluated. Then the transition of pattern_{t-1 }to pattern_{t }is binned. This protocol is executed until no more changes in the bins occur as shown
in plot (c). In (b) the graph Ω_{m}(Γ_{i}) associated to the transitions between the possible types of dynamics is represented
for C1. The thickness of the arrows correspond to transition probabilities obtained from
procedure (a). From these graphs (see Methods) we can calculate the motif evolvability
, which is found to positively correlate with ερ(Γ_{i}).
Widder |