EvoLudoLab: Moran process on random regular graphs: Difference between revisions
Created page with "{{EvoLudoLab:Moran| options="--game Moran --run --delay 100 --view Strategies_-_Structure --reportfreq 1 --popupdate B --popsize 1000 --geometry r3 --initfreqs 0:1 --mutation..." |
No edit summary |
||
(3 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
{{EvoLudoLab:Moran| | {{EvoLudoLab:Moran| | ||
options="-- | options="--module Moran --run --delay 100 --view Strategies_-_Structure --timestep 1 --popupdate B --popsize 1000 --geometry r3 --init mutant 1,0 --fitness 1,2"| | ||
title=Evolutionary dynamics on the complete graph| | title=Evolutionary dynamics on the complete graph| | ||
doc=On random regular graphs any vertex can be reached from any other one in relatively few steps. Consequentially, the invasion process of mutants is similar to the complete graph (or even unstructured populations) and no characteristic invasion patterns emerge, with the only difference that it takes a little longer. | doc=On random regular graphs any vertex can be reached from any other one in relatively few steps. Consequentially, the invasion process of mutants is similar to the complete graph (or even unstructured populations) and no characteristic invasion patterns emerge, with the only difference that it takes a little longer. | ||
For the simulations, the population size is | For the simulations, the population size is |