Rate of convergence of crossover operators
Ergodicity, mixing, rates of mixing (37A25) Dynamical systems in biology (37N25) Probability distributions: general theory (60E05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Randomized algorithms (68W20) Genetics and epigenetics (92D10)
The paper deals with a mating operator. The mating operator consists in having a stem population replaced by a new one in the following way: An individual from the new populations is obtained by randomly, uniformly sampling two distinct individuals in the stem population and mixing their genomes in some prescribed way. These operations are repeated independently in order to obtain the individuals of the new population. The aim of the paper is to answer questions of \textit{Y. Rabani} et al. [see ibid. 12, 313--334 (1998; Zbl 0955.92023)] on the divergence between finite- and infinite-population processes. To this end results for the infinite case are recalled and, moreover, specific characteristics of finite and infinite cases are explained. To obtain new results also the theory of Markov chains is employed.
This page was built for publication: Rate of convergence of crossover operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417003)