Complex Network Analysis of a Genetic Programming Phenotype Network
The genotype-to-phenotype mapping plays an essential role in the design of an evolutionary algorithm. Since variation occurs at the genotypic level but fitness is evaluated at the phenotypic level, this mapping determines how variations are effectively translated into quality improvements. We numerically study the redundant genotype-to-phenotype mapping of a simple Boolean linear genetic programming system. In particular, we investigate the resulting phenotypic network using tools of complex network analysis. The analysis yields a number of interesting statistics of this network, considered both as a directed as well as an undirected graph. We show by numerical simulation that less redundant phenotypes are more difficult to find as targets of a search than others that have much more genotypic abundance. We connect this observation with the fact that hard to find phenotypes tend to belong to small and almost isolated clusters in the phenotypic network.
KeywordsComplex networks Genetic programming Genotype-phenotype mapping Phenotype networks Evolvability
This research was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada Discovery Grant RGPIN-2016-04699 to T.H., and the Koza Endowment fund provided to W.B. by Michigan State University.
- 13.Galvan-Lopez, E., Poli, R.: An empirical investigation of how and why neutrality affects evolutionary search. In: Cattolico, M. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1149–1156 (2006)Google Scholar
- 14.Hu, T., Banzhaf, W.: Neutrality and variability: two sides of evolvability in linear genetic programming. In: Proceedings of the 18th Genetic and Evolutionary Computation Conference (GECCO), pp. 963–970 (2009)Google Scholar
- 16.Nickerson, K.L., Chen, Y., Wang, F., Hu, T.: Measuring evolvability and accessibility using the Hyperlink-Induced Topic Search algorithm. In: Proceedings of the 27th Genetic and Evolutionary Computation Conference (GECCO), pp. 1175–1182 (2018)Google Scholar
- 20.Hu, T., Payne, J.L., Banzhaf, W., Moore, J.H.: Robustness, evolvability, and accessibility in linear genetic programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds.) EuroGP 2011. LNCS, vol. 6621, pp. 13–24. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20407-4_2CrossRefGoogle Scholar
- 21.Hu, T., Banzhaf, W.: Quantitative analysis of evolvability using vertex centralities in phenotype network. In: Proceedings of the 25th Genetic and Evolutionary Computation Conference (GECCO), pp. 733–740 (2016)Google Scholar