EvoLudoLab: Moran process on the Heawood graph: Difference between revisions
From EvoLudo
(Created page with "{{EvoLudoLab:Moran| options="--game Moran --run --delay 200 --view Statistics_-_Fixation_time --reportfreq 0 --popupdate B --geometry 3 --initfreqs 0:1 --mutation 0 --basefit...") |
mNo edit summary |
||
| Line 1: | Line 1: | ||
{{EvoLudoLab:Moran| | {{EvoLudoLab:Moran| | ||
options="--game Moran --run --delay 200 --view Statistics_-_Fixation_time --reportfreq | options="--game Moran --run --delay 200 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --geometry 3 --initfreqs 0:1 --mutation 0 --basefit 1 --selection 1 --resident 1 --mutant 2"| | ||
title=Fixation and absorption times on the Heawood graph| | title=Fixation and absorption times on the Heawood graph| | ||
doc=The Heawood graph is a symmetric (arc-transitive) graph and hence the expected times until a single mutant fixes in the population, or until either one of the absorbing states is reached (homogenous population of residents or mutants), is independent of the vertex where the initial mutant arose. | doc=The Heawood graph is a symmetric (arc-transitive) graph and hence the expected times until a single mutant fixes in the population, or until either one of the absorbing states is reached (homogenous population of residents or mutants), is independent of the vertex where the initial mutant arose. | ||
