Related papers: Simulating Evolution on Fitness Landscapes represe…
One essential ingredient of evolutionary theory is the concept of fitness as a measure for a species' success in its living conditions. Here, we quantify the effect of environmental fluctuations onto fitness by analytical calculations on a…
Vertex Subset Problems (VSPs) are a class of combinatorial optimization problems on graphs where the goal is to find a subset of vertices satisfying a predefined condition. Two prominent approaches for solving VSPs are dynamic programming…
The fitness landscape defines the relationship between genotypes and fitness in a given environment, and underlies fundamental quantities such as the distribution of selection coefficient, or the magnitude and type of epistasis. A better…
In the area of evolutionary computation the calculation of diverse sets of high-quality solutions to a given optimization problem has gained momentum in recent years under the term evolutionary diversity optimization. Theoretical insights…
Sewall Wright's adaptive landscape metaphor penetrates a significant part of evolutionary thinking. Supplemented with Fisher's fundamental theorem of natural selection and Kimura's maximum principle, it provides a unifying and intuitive…
Deep neural networks proved to be a very useful and powerful tool with many practical applications. They especially excel at learning from large data sets with labeled samples. However, in order to achieve good learning results, the network…
Evolution Strategies (ESs) have recently become popular for training deep neural networks, in particular on reinforcement learning tasks, a special form of controller design. Compared to classic problems in continuous direct search, deep…
The class of epistatic fitness landscapes is much more diverse than the class of non-epistatic landscapes, and so it stands to reason that there exist dynamical phenomena that can only be realized in the presence of epistasis. Here, we…
We consider the evolutionary trajectories traced out by an infinite population undergoing mutation-selection dynamics in static, uncorrelated random fitness landscapes. Starting from the population that consists of a single genotype, the…
In this review some simple models of asexual populations evolving on smooth landscapes are studied. The basic model is based on a cellular automaton, which is analyzed here in the spatial mean-field limit. Firstly, the evolution on a fixed…
Here, we address the essential question of whether, in the context of evolving populations, ecosystems attain properties that enable persistence of the ecosystem itself. We use a simple ecosystem model describing resource, producer, and…
We study the computational complexity of exact minimisation of rational-valued discrete functions. Let $\Gamma$ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The…
In this paper we study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language {\Gamma} consisting of finitary functions on a fixed finite domain. An instance of VCSP is given…
The Santa Fe Ant model problem has been extensively used to investigate, test and evaluate Evolutionary Computing systems and methods over the past two decades. There is however no literature on its program structures that are…
The genotype-fitness map plays a fundamental role in shaping the dynamics of evolution. However, it is difficult to directly measure a fitness landscape in practice, because the number of possible genotypes is astronomical. One approach is…
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over a finite domain. An instance of the problem is specified by…
Consider a mathematical model of evolutionary adaptation of fitness landscape and mutation matrix as a reaction to population changes. As a basis, we use an open quasispecies model, which is modified to include explicit death flow. We…
This Letter studies the quasispecies dynamics of a population capable of genetic repair evolving on a time-dependent fitness landscape. We develop a model that considers an asexual population of single-stranded, conservatively replicating…
The typical complexity of Constraint Satisfaction Problems (CSPs) can be investigated by means of random ensembles of instances. The latter exhibit many threshold phenomena besides their satisfiability phase transition, in particular a…
We propose a minimal model to simulate long waiting times followed by evolutionary bursts on rugged landscapes. It combines point and inversions-like mutations as sources of genetic variation. The inversions are intended to simulate one of…