860
edits
EvoLudoLab: Moran process on the Heawood graph: Difference between revisions
From EvoLudo
EvoLudoLab: Moran process on the Heawood graph (view source)
Revision as of 00:13, 12 October 2023
, 12 October 2023no edit summary
mNo edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
{{EvoLudoLab:Moran| | {{EvoLudoLab:Moran| | ||
options="--game Moran --run --delay 200 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --geometry 3 -- | options="--game Moran --run --delay 200 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --geometry 3 --init 1,0 --inittype mutant --mutation 0 --basefit 1 --selection 1 --fitness 1,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. | ||
