Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2014, Special Issue (2013), Article ID 901363, 5 pages.

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

Pei-ai Zhang

Full-text: Open access

Abstract

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.

Article information

Source
J. Appl. Math., Volume 2014, Special Issue (2013), Article ID 901363, 5 pages.

Dates
First available in Project Euclid: 1 October 2014

Permanent link to this document
https://projecteuclid.org/euclid.jam/1412177638

Digital Object Identifier
doi:10.1155/2014/901363

Citation

Zhang, Pei-ai. Fixation Probabilities of Evolutionary Graphs Based on the Positions of New Appearing Mutants. J. Appl. Math. 2014, Special Issue (2013), Article ID 901363, 5 pages. doi:10.1155/2014/901363. https://projecteuclid.org/euclid.jam/1412177638


Export citation

References

  • E. Lieberman, C. Hauert, and M. A. Howak, “Evolutionary dynamics on graphs,” Nature, vol. 433, no. 7023, pp. 312–316, 2005.
  • H. Ohtsuki, C. Hauert, E. Lieberman, and M. A. Nowak, “A simple rule for the evolution of cooperation on graphs and social networks,” Nature, vol. 441, no. 7092, pp. 502–505, 2006.
  • P.-Y. Nie, “Evolutionary graphs on two levels,” Ars Combinatoria, vol. 86, pp. 115–120, 2008.
  • P.-Y. Nie and P.-A. Zhang, “Fixation time for evolutionary graphs,” International Journal of Modern Physics B, vol. 24, no. 27, pp. 5285–5293, 2010.
  • P.-Y. Nie and P.-A. Zhang, “Evolitopmary graphs with frequency dependent fitness,” International Journal of Modern Physics B, vol. 23, no. 4, pp. 537–543, 2009.
  • P. Shakarian, P. Roos, and A. Johnson, “A review of evolutionary graph theory with applications to game theory,” BioSystems, vol. 107, no. 2, pp. 66–80, 2012.
  • M. Broom, C. Hadjichrysanthou, and J. Rychtář, “Evolutionary games on graphs and the speed of the evolutionary process,” Proceedings of the Royal Society A, vol. 466, no. 2117, pp. 1327–1346, 2010.
  • F. Fu, L. Wang, M. A. Nowak, and C. Hauert, “Evolutionary dynamics on graphs: efficient method for weak selection,” Physical Review E, vol. 79, no. 4, Article ID 046707, 10 pages, 2009.
  • P.-A. Zhang, P.-Y. Nie, D.-Q. Hu, and F.-Y. Zou, “The analysis of bi-level evolutionary graphs,” BioSystems, vol. 90, no. 3, pp. 897–902, 2007.
  • P.-A. Zhang, P.-Y. Nie, and D.-Q. Hu, “Bi-level evolutionary graphs with multi-fitness,” IET Systems Biology, vol. 4, no. 1, pp. 33–38, 2010.
  • M. A. Nowak, Evolutionary Dynamics Exploring the Equations of Life, Harvard University Press, Cambridge, Mass, USA, 2005.
  • A. Zhou, “Stability analysis for various business forms,” in Applied Economics, Business and Development, Q. Zhou, Ed., vol. 208 of Communications in Computer and Information Science, pp. 1–7, Springer, Berlin, Germany, 2011. \endinput