EvoLudoLab: Fixation times on the complete graph - Revision history

Hauert at 21:31, 12 August 2024

2024-08-12T21:31:13Z

← Older revision		Revision as of 14:31, 12 August 2024
Line 1:		Line 1:
	{{EvoLudoLab:Moran\|		{{EvoLudoLab:Moran\|
	options="--module Moran --run --delay 50 --view Statistics_-_Fixation_time --timestep 1 --popupdate B --popsize 81 --geometry c --~~inittype~~ mutant 1,0 --fitness 1,2"\|		options="--module Moran --run --delay 50 --view Statistics_-_Fixation_time --timestep 1 --popupdate B --popsize 81 --geometry c --init mutant 1,0 --fitness 1,2"\|
	title=Fixation times on the complete graph \|		title=Fixation times on the complete graph \|
	doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.		doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.

	For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}		For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}

Hauert at 18:28, 4 August 2024

2024-08-04T18:28:24Z

← Older revision		Revision as of 11:28, 4 August 2024
Line 1:		Line 1:
	{{EvoLudoLab:Moran\|		{{EvoLudoLab:Moran\|
	options="--~~game~~ Moran --run --delay 50 --view Statistics_-_Fixation_time --~~reportfreq~~ 1 --popupdate B --popsize 81 --geometry c --~~init~~ 1,0 ~~--inittype mutant --mutation 0 --basefit 1 --selection 1~~ --fitness 1,2"\|		options="--module Moran --run --delay 50 --view Statistics_-_Fixation_time --timestep 1 --popupdate B --popsize 81 --geometry c --inittype mutant 1,0 --fitness 1,2"\|
	title=Fixation times on the complete graph \|		title=Fixation times on the complete graph \|
	doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.		doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.

	For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}		For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}

Hauert at 07:01, 12 October 2023

2023-10-12T07:01:04Z

← Older revision		Revision as of 00:01, 12 October 2023
Line 1:		Line 1:
	{{EvoLudoLab:Moran\|		{{EvoLudoLab:Moran\|
	options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --~~initfreqs~~ 1:0 --mutation 0 --basefit 1 --selection 1 --fitness 1:2"\|		options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --init 1,0 --inittype mutant --mutation 0 --basefit 1 --selection 1 --fitness 1,2"\|
	title=Fixation times on the complete graph \|		title=Fixation times on the complete graph \|
	doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.		doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.

	For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}		For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}

Hauert at 04:22, 18 December 2018

2018-12-18T04:22:54Z

← Older revision		Revision as of 21:22, 17 December 2018
Line 1:		Line 1:
	{{EvoLudoLab:Moran\|		{{EvoLudoLab:Moran\|
	options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --initfreqs 0:1 --mutation 0 --basefit 1 --selection 1 --~~resident~~ 1 ~~--mutant~~ 2"\|		options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --initfreqs 1:0 --mutation 0 --basefit 1 --selection 1 --fitness 1:2"\|
	title=Fixation times on the complete graph \|		title=Fixation times on the complete graph \|
	doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.		doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.

	For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}		For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}

Hauert: Created page with "{{EvoLudoLab:Moran| options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --initfreqs 0:1 --mutation..."

2016-08-30T23:25:51Z

Created page with "{{EvoLudoLab:Moran| options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --initfreqs 0:1 --mutation..."

New page

{{EvoLudoLab:Moran|
options="--game Moran --run --delay 50 --view Statistics_-_Fixation_time --reportfreq 1 --popupdate B --popsize 81 --geometry c --initfreqs 0:1 --mutation 0 --basefit 1 --selection 1 --resident 1 --mutant 2"|
title=Fixation times on the complete graph |
doc=Even though fixation probabilities are the same on the complete graph as on any other circulation, the corresponding fixation and absorption times can be vastly different. The diameter of the complete graph (the average minimal number of steps to reach any vertex from any other one) is constant \(1\) and, in particular, independent of \(N\). Hence, fixation times are short and essentially indistinguishable from unstructured populations. Possibly the fixation times on the complete graph are the shortest on any circulation with undirected links.

For the simulations, the population size is \(N=81\) with \(k=80\) neighbours and hence a total of \(3'240\) links. The fitness of residents is set to \(1\) and that of mutants to \(2\). Thus, a single mutant has approximately a \(50\%\) chance to take over the population. For reference, the analytical fixation and absorption times of the original Moran process are indicated by a dark red line.}}