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

Pei-ai Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Pei-ai Zhang

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/901363

Subject(s) - fixation (population genetics) , evolutionary dynamics , fixation time , markov chain , population , mathematics , graph , evolutionary algorithm , markov process , evolutionary game theory , mathematical optimization , mathematical economics , statistical physics , computer science , combinatorics , game theory , statistics , physics , medicine , demography , sociology , audiology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research