The network structure affects the fixation probability when it couples to the birth-death dynamics in finite population

Abstract

The study of evolutionary dynamics on graphs is an interesting topic for researchers in various fields of science and mathematics. In systems with finite population, different model dynamics are distinguished by their effects on two important quantities: fixation probability and fixation time. The isothermal theorem declares that the fixation probability is the same for a wide range of graphs and it only depends on the population size. This has also been proved for more complex graphs that are called complex networks. In this work, we propose a model that couples the population dynamics to the network structure and show that in this case, the isothermal theorem is being violated. In our model the death rate of a mutant depends on its number of neighbors, and neutral drift holds only in the average. We investigate the fixation probability behavior in terms of the complexity parameter, such as the scale-free exponent for the scale-free network and the rewiring probability for the small-world network.

Multi-strategy evolutionary games: A Markov chain approach

“…The structure of the population can also affect the dynamics of population. Unfolding an evolutionary game in graph-structured populations is the subject of many investigation [ 13 , 22 – 29 ]. Cooperative behaviors in games like public good game or prisoner’s dilemma is a charming topic in evolutionary games investitations [ 30 – 36 ].…”