An analysis of the fixation probability of a mutant on special classes of non-directed graphs

Abstract

There is a growing interest in the study of evolutionary dynamics on populations with some non-homogeneous structure. In this paper we follow the model of Lieberman et al . (Lieberman et al . 2005 Nature 433 , 312–316) of evolutionary dynamics on a graph. We investigate the case of non-directed equally weighted graphs and find solutions for the fixation probability of a single mutant in two classes of simple graphs. We further demonstrate that finding similar solutions on graphs outside these classes is far more complex. Finally, we investigate our chosen classes numerically and discuss a number of features of the graphs; for example, we find the fixation probabilities for different initial starting positions and observe that average fixation probabilities are always increased for advantageous mutants as compared with those of unstructured populations.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 176 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.