IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1011387.html
   My bibliography  Save this article

Self-loops in evolutionary graph theory: Friends or foes?

Author

Listed:
  • Nikhil Sharma
  • Sedigheh Yagoobi
  • Arne Traulsen

Abstract

Evolutionary dynamics in spatially structured populations has been studied for a long time. More recently, the focus has been to construct structures that amplify selection by fixing beneficial mutations with higher probability than the well-mixed population and lower probability of fixation for deleterious mutations. It has been shown that for a structure to substantially amplify selection, self-loops are necessary when mutants appear predominately in nodes that change often. As a result, for low mutation rates, self-looped amplifiers attain higher steady-state average fitness in the mutation-selection balance than well-mixed populations. But what happens when the mutation rate increases such that fixation probabilities alone no longer describe the dynamics? We show that self-loops effects are detrimental outside the low mutation rate regime. In the intermediate and high mutation rate regime, amplifiers of selection attain lower steady-state average fitness than the complete graph and suppressors of selection. We also provide an estimate of the mutation rate beyond which the mutation-selection dynamics on a graph deviates from the weak mutation rate approximation. It involves computing average fixation time scaling with respect to the population sizes for several graphs.Author summary: Evolutionary and ecological dynamics is strongly affected by the underlying population structure. Evolutionary graph theory considers networks in which individuals are placed on the nodes and replace each other via the links. Amplifiers and suppressors of selection are particularly intriguing structures that can effectively change the selective advantage of a mutant compared to unstructured populations. For very low mutation rates, strong amplification requires that mutants can replace their parents via self-loops. We show that this beneficial role of self-loops is reversed when the mutation rate is increased: In this case, self looped-graphs have a lower average fitness in mutation-selection balance. More generally, we show that suppressors of fixation—structures that reduce the fixation of mutants regardless of their relative fitness—can increase the fitness in mutation selection balance both for weak mutation and for strong mutation. This calls for a closer investigation of structures other than the amplifiers of selection.

Suggested Citation

  • Nikhil Sharma & Sedigheh Yagoobi & Arne Traulsen, 2023. "Self-loops in evolutionary graph theory: Friends or foes?," PLOS Computational Biology, Public Library of Science, vol. 19(9), pages 1-32, September.
  • Handle: RePEc:plo:pcbi00:1011387
    DOI: 10.1371/journal.pcbi.1011387
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1011387
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1011387&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1011387?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. Erez Lieberman & Christoph Hauert & Martin A. Nowak, 2005. "Evolutionary dynamics on graphs," Nature, Nature, vol. 433(7023), pages 312-316, January.
    2. McCandlish, David M. & Epstein, Charles L. & Plotkin, Joshua B., 2015. "Formal properties of the probability of fixation: Identities, inequalities and approximations," Theoretical Population Biology, Elsevier, vol. 99(C), pages 98-113.
    3. Josef Tkadlec & Andreas Pavlogiannis & Krishnendu Chatterjee & Martin A. Nowak, 2021. "Fast and strong amplifiers of natural selection," Nature Communications, Nature, vol. 12(1), pages 1-6, December.
    4. C. Hadjichrysanthou & M. Broom & J. Rychtář, 2011. "Evolutionary Games on Star Graphs Under Various Updating Rules," Dynamic Games and Applications, Springer, vol. 1(3), pages 386-407, September.
    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. Josef Tkadlec & Andreas Pavlogiannis & Krishnendu Chatterjee & Martin A Nowak, 2020. "Limits on amplifiers of natural selection under death-Birth updating," PLOS Computational Biology, Public Library of Science, vol. 16(1), pages 1-13, January.
    2. Benjamin Allen & Christine Sample & Robert Jencks & James Withers & Patricia Steinhagen & Lori Brizuela & Joshua Kolodny & Darren Parke & Gabor Lippner & Yulia A Dementieva, 2020. "Transient amplifiers of selection and reducers of fixation for death-Birth updating on graphs," PLOS Computational Biology, Public Library of Science, vol. 16(1), pages 1-20, January.
    3. Nikhil Sharma & Suman G. Das & Joachim Krug & Arne Traulsen, 2025. "Graph-structured populations elucidate the role of deleterious mutations in long-term evolution," Nature Communications, Nature, vol. 16(1), pages 1-12, December.
    4. Mark Broom & Jan Rychtář, 2018. "Ideal Cost-Free Distributions in Structured Populations for General Payoff Functions," Dynamic Games and Applications, Springer, vol. 8(1), pages 79-92, March.
    5. 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.
    6. Jakub Svoboda & Soham Joshi & Josef Tkadlec & Krishnendu Chatterjee, 2024. "Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating," PLOS Computational Biology, Public Library of Science, vol. 20(3), pages 1-12, March.
    7. Wes Maciejewski & Feng Fu & Christoph Hauert, 2014. "Evolutionary Game Dynamics in Populations with Heterogenous Structures," PLOS Computational Biology, Public Library of Science, vol. 10(4), pages 1-16, April.
    8. Konno, Tomohiko, 2013. "An imperfect competition on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5453-5460.
    9. 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.
    10. repec:osf:osfxxx:ucx8z_v1 is not listed on IDEAS
    11. 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.
    12. Xiang Wei & Peng Xu & Shuiting Du & Guanghui Yan & Huayan Pei, 2021. "Reputational preference-based payoff punishment promotes cooperation in spatial social dilemmas," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 94(10), pages 1-7, October.
    13. Wang, Mengyao & Pan, Qiuhui & He, Mingfeng, 2020. "The effect of individual attitude on cooperation in social dilemma," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    14. Lv, Shaojie & Song, Feifei, 2022. "Particle swarm intelligence and the evolution of cooperation in the spatial public goods game with punishment," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    15. Wu, Jieyu & Shao, Xinyu & Li, Jinhang & Huang, Gang, 2012. "Scale-free properties of information flux networks in genetic algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1692-1701.
    16. Yang Ping Kuo & Oana Carja, 2024. "Evolutionary graph theory beyond pairwise interactions: Higher-order network motifs shape times to fixation in structured populations," PLOS Computational Biology, Public Library of Science, vol. 20(3), pages 1-19, March.
    17. K. Kułakowski, 2009. "The norm game: punishing enemies and not friends," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 4(1), pages 27-37, June.
    18. Zhang, Hui & Wang, Li & Hou, Dongshuang, 2016. "Effect of the spatial autocorrelation of empty sites on the evolution of cooperation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 296-308.
    19. Huo, Ran & Durrett, Rick, 2018. "Latent voter model on locally tree-like random graphs," Stochastic Processes and their Applications, Elsevier, vol. 128(5), pages 1590-1614.
    20. Antoine Nongaillard & Philippe Mathieu, 2011. "Reallocation Problems in Agent Societies: A Local Mechanism to Maximize Social Welfare," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 14(3), pages 1-5.
    21. Laura Schmid & Farbod Ekbatani & Christian Hilbe & Krishnendu Chatterjee, 2023. "Quantitative assessment can stabilize indirect reciprocity under imperfect information," Nature Communications, Nature, vol. 14(1), pages 1-14, December.

    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:plo:pcbi00:1011387. 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: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    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.