Fixation Probabilities of Evolutionary Graphs Based on the Positions of New Appearing Mutants

Abstract EN

Evolutionary graph theory is a nice measure to implement evolutionary dynamics on spatial structures of populations.

To calculate the fixation probability is usually regarded as a Markov chain process, which is affected by the number of the individuals, the fitness of the mutant, the game strategy, and the structure of the population.

However the position of the new mutant is important to its fixation probability.

Here the position of the new mutant is laid emphasis on.

The method is put forward to calculate the fixation probability of an evolutionary graph (EG) of single level.

Then for a class of bilevel EGs, their fixation probabilities are calculated and some propositions are discussed.

The conclusion is obtained showing that the bilevel EG is more stable than the corresponding one-rooted EG.