Fig. 7.

Behaviour of the approximative search of Algorithm 1 for $N=\{14,20,26\}$ and $k=\{11,17,23\}$. The effective population size $N_{\text{eff}}$ and the spectral density ${\varphi }_{\mathcal{G}}$ describing graph evolutions leading to transient amplifiers over edge removal repetitions $\ell$. a,b $N=14$, $k=11$. c, d $N=20$, $k=17$. e, f $N=26$, $k=23$. See Appendix, Fig. 15, for the spectral density ${\varphi }_{{\mathcal{G}}^{\prime }}$ and the difference $|{\varphi }_{\mathcal{G}}-{\varphi }_{{\mathcal{G}}^{\prime }}|$