Neutral Network Assortativity Shapes Whether Selective Pressure Promotes or Hinders Robustness
Shorten, David and Geoff Nitschke (2016) Neutral Network Assortativity Shapes Whether Selective Pressure Promotes or Hinders Robustness. In Proceedings IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2016), pages 2370-2376, Athens, Greece.
Due to the friendship paradox, the average robustness of the single mutation neighbours (µn) of genotypes on a neutral network is larger than the average robustness of the genotypes (µg). Random walks on neutral networks have an average degree equal to µn and, intuitively, we expect that evolution will not converge on populations whose average degree is considerably lower than this. This paper argues that a population achieving an average robustness higher than µn is facilitated by nodes of degree higher than µn being mutationally biased towards other nodes of degree higher than µn. Thus, we present the hypothesis that, for biologically realistic degree distributions, assortativity allows selection to increase robustness above µn. Furthermore, although counterexamples do exist, it is argued that it is highly plausible that in the majority of cases in which selection increases robustness above µn, that the neutral network is assortative. These arguments are reinforced by simulations of evolution on randomly generated Erdos-Renyi and power-law networks. Elucidating the role of assortativity provides valuable insight into the mechanisms by which robustness evolves as well as the conditions under which it will do so. Moreover, it demonstrates the large influence that higher-order mutational biases can have on evolutionary dynamics.
|EPrint Type:||Conference Paper|
|Subjects:||I Computing Methodologies: I.6 SIMULATION AND MODELING|
|Deposited By:||Nitschke, Geoff|
|Deposited On:||23 November 2017|