Open AccessThe network structure affects the fixation probability when it couples to the birth-death dynamics in finite population
Author(s) -
Mohammad Ali Dehghani,
Amir H. Darooneh,
Mohammad Kohandel
Publication year - 2021
Publication title -
plos computational biology/plos computational biology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.628
H-Index - 182
eISSN - 1553-7358
pISSN - 1553-734X
DOI - 10.1371/journal.pcbi.1009537
Subject(s) - fixation (population genetics) , birth–death process , random graph , population , complex network , statistical physics , exponent , mathematics , scale free network , computer science , combinatorics , physics , graph , demography , linguistics , philosophy , sociology
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.