{"publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]},"year":"2020","volume":16,"issue":"11","language":[{"iso":"eng"}],"date_updated":"2023-08-22T12:49:18Z","date_created":"2020-11-18T07:20:23Z","publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","date_created":"2020-11-18T07:26:10Z","date_updated":"2020-11-18T07:26:10Z","relation":"main_file","file_name":"2020_PlosCompBio_Kaveh.pdf","file_size":2498594,"content_type":"application/pdf","checksum":"555456dd0e47bcf9e0994bcb95577e88","success":1,"file_id":"8768"}],"month":"11","scopus_import":"1","article_number":"e1008402","oa_version":"Published Version","_id":"8767","status":"public","publication":"PLOS Computational Biology","author":[{"last_name":"Kaveh","full_name":"Kaveh, Kamran","first_name":"Kamran"},{"first_name":"Alex","last_name":"McAvoy","full_name":"McAvoy, Alex"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","full_name":"Nowak, Martin A.","first_name":"Martin A."}],"department":[{"_id":"KrCh"}],"acknowledgement":"We thank Igor Erovenko for many helpful comments on an earlier version of this paper. : Army Research Laboratory (grant W911NF-18-2-0265) (M.A.N.); the Bill & Melinda Gates Foundation (grant OPP1148627) (M.A.N.); the NVIDIA Corporation (A.M.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","title":"The Moran process on 2-chromatic graphs","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"intvolume":" 16","external_id":{"isi":["000591317200004"]},"date_published":"2020-11-05T00:00:00Z","article_processing_charge":"No","doi":"10.1371/journal.pcbi.1008402","citation":{"chicago":"Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1008402.","ama":"Kaveh K, McAvoy A, Chatterjee K, Nowak MA. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 2020;16(11). doi:10.1371/journal.pcbi.1008402","ieee":"K. Kaveh, A. McAvoy, K. Chatterjee, and M. A. Nowak, “The Moran process on 2-chromatic graphs,” PLOS Computational Biology, vol. 16, no. 11. Public Library of Science, 2020.","mla":"Kaveh, Kamran, et al. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology, vol. 16, no. 11, e1008402, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1008402.","short":"K. Kaveh, A. McAvoy, K. Chatterjee, M.A. Nowak, PLOS Computational Biology 16 (2020).","ista":"Kaveh K, McAvoy A, Chatterjee K, Nowak MA. 2020. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 16(11), e1008402.","apa":"Kaveh, K., McAvoy, A., Chatterjee, K., & Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008402"},"article_type":"original","quality_controlled":"1","keyword":["Ecology","Modelling and Simulation","Computational Theory and Mathematics","Genetics","Ecology","Evolution","Behavior and Systematics","Molecular Biology","Cellular and Molecular Neuroscience"],"has_accepted_license":"1","abstract":[{"text":"Resources are rarely distributed uniformly within a population. Heterogeneity in the concentration of a drug, the quality of breeding sites, or wealth can all affect evolutionary dynamics. In this study, we represent a collection of properties affecting the fitness at a given location using a color. A green node is rich in resources while a red node is poorer. More colors can represent a broader spectrum of resource qualities. For a population evolving according to the birth-death Moran model, the first question we address is which structures, identified by graph connectivity and graph coloring, are evolutionarily equivalent. We prove that all properly two-colored, undirected, regular graphs are evolutionarily equivalent (where “properly colored” means that no two neighbors have the same color). We then compare the effects of background heterogeneity on properly two-colored graphs to those with alternative schemes in which the colors are permuted. Finally, we discuss dynamic coloring as a model for spatiotemporal resource fluctuations, and we illustrate that random dynamic colorings often diminish the effects of background heterogeneity relative to a proper two-coloring.","lang":"eng"}],"isi":1,"publisher":"Public Library of Science","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2020-11-18T07:26:10Z","type":"journal_article","day":"05"}