Perturbation theory and the renormalization group in genetic dynamics

Authors:
Christopher R. Stephens;Adolfo Zamora;Alden H. Wright
Affiliations:
Instituto de Ciencias Nucleares, UNAM, Circuito Exterior, México D.F.;Instituto de Ciencias Nucleares, UNAM, Circuito Exterior, México D.F.;Dept. of Computer Science, University of Montana, Missoula, MT
Venue:
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Year:
2005

Citing 6
Cited 0

Statistical mechanics theory of genetic algorithms

Theoretical aspects of evolutionary computing
Foundations of genetic programming

Foundations of genetic programming
Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover

Genetic Programming and Evolvable Machines
A Fixed Point Analysis Of A Gene Pool GA With Mutation

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory

Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Schemata evolution and building blocks

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although much progress has been made in recent years in the theory of GAs and GP, there is still a conspicuous lack of tools with which to derive systematic, approximate solutions to their dynamics. In this article we propose and study perturbation theory as a potential tool to fill this gap. We concentrate mainly on selection-mutation systems, showing different implementations of the perturbative framework, developing, for example, perturbative expansions for the eigenvalues and eigenvectors of the transition matrix. The main focus however, is on diagrammatic methods, taken from physics, where we show how approximations can be built up using a pictorial representation generated by a simple set of rules, and how the renormalization group can be used to systematically improve the perturbation theory.