IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n901363.html

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

Author

Listed:
  • Pei-ai Zhang

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.

Suggested Citation

  • Pei-ai Zhang, 2014. "Fixation Probabilities of Evolutionary Graphs Based on the Positions of New Appearing Mutants," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:901363
    DOI: 10.1155/2014/901363
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/901363
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/901363?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hisashi Ohtsuki & Christoph Hauert & Erez Lieberman & Martin A. Nowak, 2006. "A simple rule for the evolution of cooperation on graphs and social networks," Nature, Nature, vol. 441(7092), pages 502-505, May.
    2. Erez Lieberman & Christoph Hauert & Martin A. Nowak, 2005. "Evolutionary dynamics on graphs," Nature, Nature, vol. 433(7023), pages 312-316, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. R. Bentley & Michael O’Brien & Paul Ormerod, 2011. "Quality versus mere popularity: a conceptual map for understanding human behavior," Mind & Society: Cognitive Studies in Economics and Social Sciences, Springer;Fondazione Rosselli, vol. 10(2), pages 181-191, December.
    2. Sun, Xingping & Feng, Kaiyu & Kang, Hongwei & Shen, Yong & Chen, Qingyi, 2026. "Adaptive migration guided by reputation-pheromone dynamics in spatial games," Chaos, Solitons & Fractals, Elsevier, vol. 202(P1).
    3. Arnaud Z. Dragicevic, 2025. "The Price Identity of Replicator(–Mutator) Dynamics on Graphs with Quantum Strategies in a Public Goods Game," Dynamic Games and Applications, Springer, vol. 15(1), pages 74-102, March.
    4. Wakano, Joe Yuichiro & Ohtsuki, Hisashi & Kobayashi, Yutaka, 2013. "A mathematical description of the inclusive fitness theory," Theoretical Population Biology, Elsevier, vol. 84(C), pages 46-55.
    5. Wang, Jianwei & Xu, Wenshu & Yu, Fengyuan & He, Jialu & Chen, Wei & Dai, Wenhui, 2024. "Evolution of cooperation under corrupt institutions," Chaos, Solitons & Fractals, Elsevier, vol. 184(C).
    6. McAvoy, Alex & Fraiman, Nicolas & Hauert, Christoph & Wakeley, John & Nowak, Martin A., 2018. "Public goods games in populations with fluctuating size," Theoretical Population Biology, Elsevier, vol. 121(C), pages 72-84.
    7. Qiguang An & Hongfeng Guo & Yating Zheng, 2022. "On Robust Stability and Stabilization of Networked Evolutionary Games with Time Delays," Mathematics, MDPI, vol. 10(15), pages 1-12, July.
    8. Alexander J. Stewart & Joshua B. Plotkin, 2015. "The Evolvability of Cooperation under Local and Non-Local Mutations," Games, MDPI, vol. 6(3), pages 1-20, July.
    9. Benjamin Allen & Christine Sample & Yulia Dementieva & Ruben C Medeiros & Christopher Paoletti & Martin A Nowak, 2015. "The Molecular Clock of Neutral Evolution Can Be Accelerated or Slowed by Asymmetric Spatial Structure," PLOS Computational Biology, Public Library of Science, vol. 11(2), pages 1-32, February.
    10. Christopher Graser & Takako Fujiwara-Greve & Julián García & Matthijs van Veelen, 2025. "Repeated games with partner choice," PLOS Computational Biology, Public Library of Science, vol. 21(2), pages 1-19, February.
    11. D. Timothy Bishop & Mark Broom & Richard Southwell, 2020. "Chris Cannings: A Life in Games," Dynamic Games and Applications, Springer, vol. 10(3), pages 591-617, September.
    12. Klaus Jaffe & Roberto Cipriani, 2007. "Culture Outsmarts Nature in the Evolution of Cooperation," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 10(1), pages 1-7.
    13. Spiekermann, Kai, 2009. "Sort out your neighbourhood: public good games on dynamic networks," LSE Research Online Documents on Economics 26739, London School of Economics and Political Science, LSE Library.
    14. Fabio Della Rossa & Fabio Dercole & Anna Di Meglio, 2020. "Direct Reciprocity and Model-Predictive Strategy Update Explain the Network Reciprocity Observed in Socioeconomic Networks," Games, MDPI, vol. 11(1), pages 1-28, March.
    15. Sarkar, Bijan, 2021. "The cooperation–defection evolution on social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    16. Li, Bin-Quan & Wu, Zhi-Xi & Guan, Jian-Yue, 2022. "Critical thresholds of benefit distribution in an extended snowdrift game model," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    17. Diogo L Pires & Igor V Erovenko & Mark Broom, 2023. "Network topology and movement cost, not updating mechanism, determine the evolution of cooperation in mobile structured populations," PLOS ONE, Public Library of Science, vol. 18(8), pages 1-29, August.
    18. Wang, Chaoqian & Szolnoki, Attila, 2023. "Inertia in spatial public goods games under weak selection," Applied Mathematics and Computation, Elsevier, vol. 449(C).
    19. Wu, Chengxing & Deng, Hongzhong & Tu, Chengyi, 2024. "A general network complexity reduction method for cooperative evolution in structured populations," Chaos, Solitons & Fractals, Elsevier, vol. 188(C).
    20. Mark Broom & Igor V. Erovenko & Jan Rychtář, 2021. "Modelling Evolution in Structured Populations Involving Multiplayer Interactions," Dynamic Games and Applications, Springer, vol. 11(2), pages 270-293, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:901363. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.