2020
DOI: 10.1371/journal.pcbi.1008402
|View full text |Cite
|
Sign up to set email alerts
|

The Moran process on 2-chromatic graphs

Abstract: 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 questi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(13 citation statements)
references
References 53 publications
1
12
0
Order By: Relevance
“…Ref. [24] showed that this does not happen for two-chromatic graphs (T = 2 in our case). This is confirmed from figure 5 a.…”
Section: A Effect Of Fitness Heterogeneity In Selection Advantagementioning
confidence: 70%
See 3 more Smart Citations
“…Ref. [24] showed that this does not happen for two-chromatic graphs (T = 2 in our case). This is confirmed from figure 5 a.…”
Section: A Effect Of Fitness Heterogeneity In Selection Advantagementioning
confidence: 70%
“…Similarly fitness values at a red node are a R and b R . This is a color-to-fitness map [24] and can be summarized into a simple matrix form,…”
Section: Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…We can consider birthdeath processes with more than two competing species, each with different fitnesses [43,44]. We can consider heterogeneous graphs, where fitness is attributed to nodes on the graph, as well as the species of the individual occupying it [45]. We can consider evolutionary games on graphs, where individuals connected by graph edges compete in games for some pay-off [25,42,[46][47][48].…”
Section: Discussionmentioning
confidence: 99%