Sharp asymptotic results for simplified mutation-selection algorithms

DOI10.1214/aoap/1069786510zbMath1036.60026OpenAlexW1560413773MaRDI QIDQ1429118

Alexis Bienvenüe, Jean Bérard

Publication date: 30 March 2004

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1069786510

zbMATH Keywords

random walksinvariance principlepopulation dynamicslarge deviationsinteracting particle systems

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Problems related to evolution (92D15) Large deviations (60F10) Functional limit theorems; invariance principles (60F17)

Related Items

Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding, Multistage Markov Chain Modeling of the Genetic Algorithm and Convergence Results, A weighted random walk model, with application to a genetic algorithm, The quasispecies regime for the simple genetic algorithm with ranking selection

Uses Software

• MersenneTwister

Cites Work

• Evolution on a smooth landscape
• Asymptotic convergence of genetic algorithms
• Mersenne twister
• Techniques for bounding the convergence rate of genetic algorithms
• Un principe d'invariance pour un algorithme génétique en population finie
• Stochastic model of evolving populations
• Probability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item