Michael D. Vose

Learn More
We model a simple genetic algorithm as a Markov chain. Our method is both complete (selection, mutation, and crossover are incorporated into an explicitly given transition matrix) and exact; no special assumptions are made which restrict populations or population trajectories. We also consider the asymptotics of the steady state distributions as population(More)
A bstract. We introd uce a formaliza tion of a simple genetic algori thm. Mathemati cally, two mat rices F and M determine select ion and recombination operators. Fixed points and their stability for these operators ar e investiga ted in terms of the eigenvalues of the associated matrices. We apply our results to one-po int crossover wit h muta tion to(More)
Sexual conflict has been suggested as a general cause of genetic diversification in reproductive characters, and as a possible cause of speciation. We use individual-based simulations to study the dynamics of sexual conflict in an isolated diploid population with no spatial structure. To explore the effects of genetic details, we consider two different(More)
There is a developing theory of growing power which, at its current stage of development (indeed, for a number of years now), speaks to qualitative and quantitative aspects of search strategies. Although it has been specialized and applied to genetic algorithms, it's implications and applicability are far more general. This paper deals with the broad(More)
A classical view of speciation is that reproductive isolation arises as a by-product of genetic divergence. Here, individual-based simulations are used to evaluate whether the mechanisms implied by this view may result in rapid speciation if the only source of genetic divergence are mutation and random genetic drift. Distinctive features of the simulations(More)