Evolution on Neutral Networks in Genetic Programming

Abstract

We examine the behaviour of an evolutionary search onneutral networks in a simple linear GP system of aBoolean function space problem. To this end we drawparallels between notions in RNA-folding problems andin Genetic Programming, observe parameters of neutralnetworks and discuss the population dynamics via theoccupation probability of network nodes in runs ontheir way to the optimal solution.