Sharp asymptotic results for simplified mutation-selection algorithms (Q1429118): Difference between revisions

The authors study the asymptotic behaviour of a mutation-selection genetic algorithm on the integers with finite population of size \(p\). The mutation is defined by the steps of a simple random walk and the fitness function is linear. The authors prove that the normalized population satisfies an invariance principle, that a large deviations principle holds and that the relative positions converge in law as well as that after \(n\) steps, the population is asymptotically around \(\sqrt{n}\) times the position at time 1 of a Bessel process of dimension \(2p-1\).