Absorption and fixation times for evolutionary processes on graphs

TL;DR

This paper analyzes how absorption and fixation times in evolutionary graph processes depend on parameters like update rules, symmetry, and proliferation probability, revealing critical thresholds and monotonic behaviors.

Contribution

It introduces a detailed analysis of fixation times under various updating rules, clarifies the role of symmetries, and identifies critical probabilities affecting fixation dynamics.

Findings

Fixation time depends on the proliferation probability p and exhibits monotonic behavior.

Symmetry considerations depend on the graph structure, with exceptions like cliques and cycles.

A critical value p_c determines whether proliferation is advantageous or disadvantageous in fixation probability.

Abstract

In this paper, we study the absorption and fixation times for evolutionary processes on graphs, under different updating rules. While in Moran process a single neighbour is randomly chosen to be replaced, in proliferation processes other neighbours can be replaced using Bernoulli or binomial draws depending on $0 < p \leq 1$. There is a critical value $p_c$ such that the proliferation is advantageous or disadvantageous in terms of fixation probability depending on whether $p > p_c$ or $p < p_c$. We clarify the role of symmetries for computing the fixation time in Moran process. We show that the Maruyama-Kimura symmetry depend on the graph structure induced in each state, implying asymmetry for all graphs except cliques and cycles. There is a fitness value, not necessarily $1$, beyond which the fixation time decreases monotonically. We apply Harris' graphical method to prove that the fixation time decreases monotonically depending on $p$. Thus there exists another value $p_t$ for which the proliferation is advantageous or disadvantageous in terms of time. However, at the critical level $p=p_c$, the proliferation is highly advantageous when $r \to +\infty$.