Fixation times on directed graphs.

Abstract excerpt

Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate r which invades a population of residents. We say that the fixation time is "fast" if it is at most a polynomial function in terms of the population size N. Here we study fixation times of advantageous mutants (r > 1) and neutral mutants (r = 1)...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Biological Evolution
• Share to Computational Biology