Evolutionary graph theory: Difference between revisions

Evolutionary graph theory (view source)

603 bytes added , 13 July 2016

860

edits

@@ Line 71: / Line 71: @@
 ===Spatial Moran process===
-The Moran process can be easily generalized to structured populations or graphs by restricting step 2 above such that the offspring of the focal individual replaces one of its ''neighbours'' rather than a random member of the population.
+For the Moran process in structured populations the essential difference is that the offspring of the focal individual replaces a random ''neighbor'' instead of a random member of the population. An additional minor difference is that the offspring cannot replace the focal individual but, in principle, this can be implemented by adding loops to each node.
+Provided that the graph is connected – each node is connected to every other node through a series of links – the population maintains the same two absorbing states with all residents or all mutants. If the graph is not connected, mutant fixation is impossible. As before, we are interested in the fixation probability of a single mutant in a structured resident population and, more specifically, the effect of limited dispersal of offspring on the mutant fixation probability.
 {{-}}