Related papers: Evolution in complex objects
We investigate the ability of a genetic algorithm to design cellular automata that perform computations. The computational strategies of the resulting cellular automata can be understood using a framework in which ``particles'' embedded in…
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…
In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing…
Most complex systems are intrinsically dynamic in nature. The evolution of a dynamic complex system is typically represented as a sequence of snapshots, where each snapshot describes the configuration of the system at a particular instant…
In this work, we describe a self-replication-based mechanism for designing agents of increasing complexity. We demonstrate the validity of this approach by solving simple, standard evolutionary computation problems in simulation. In the…
This paper presents an application of evolutionary search procedures to artificial neural networks. Here, we can distinguish among three kinds of evolution in artificial neural networks, i.e. the evolution of connection weights, of…
The use of evolutionary methods in design and art is increasing in diversity and popularity. Approaches to using these methods for creative production typically focus either on optimisation or exploration. In this paper we introduce an…
I review the basic concepts for the spectrophotometric and chemical evolution of galaxies, contrast various approaches and discuss their respective advantages and shortcomings, both for the interpretation of nearby and high redshift…
In the spirit of the many recent simple models of evolution inspired by statistical physics, we put forward a simple model of the evolution of such models. Like its objects of study, it is (one supposes) in principle testable and capable of…
We give a self-contained introduction to the theory of directed graphs, leading up to the relationship between the Perron-Frobenius eigenvectors of a graph and its autocatalytic sets. Then we discuss a particular dynamical system on a fixed…
Applied research in graph algorithms and combinatorial structures needs comprehensive and versatile software libraries. However, the design and the implementation of flexible libraries are challenging activities. Among the other problems…
This article reviews and presents various solved and open problems in the development, analysis, and control of epidemic models. We are interested in presenting a relatively concise report for new engineers looking to enter the field of…
Molecular phenotypes are important links between genomic information and organismic functions, fitness, and evolution. Complex phenotypes, which are also called quantitative traits, often depend on multiple genomic loci. Their evolution…
The concept of hierarchy in complex systems is tightly linked to co-evolutionary processes. We propose here to explore it in the case of the co-evolution between transportation networks and territories. More precisely, we extend a…
Generalized models provide a framework for the study of evolution equations without specifying all functional forms. The generalized formulation of problems has been shown to facilitate the analytical investigation of local dynamics and has…
Different evolutionary models are known to make disparate predictions for the success of an invading mutant in some situations. For example, some evolutionary mechanics lead to amplification of selection in structured populations, while…
In order to make a case for or against a trend in the evolution of complexity in biological evolution, complexity needs to be both rigorously defined and measurable. A recent information-theoretic (but intuitively evident) definition…
he greatest weakness of evolutionary algorithms, widely used today, is the premature convergence due to the loss of population diversity over generations. To overcome this problem, several algorithms have been proposed, such as the…
The aim of this paper is to study the evolution of a material point of a body by itself, and not the body as a whole. To do this, we construct a groupoid encoding all the intrinsic properties of the particle and its characteristic…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…