← All problems
Unverified

Existence of a universal amplifier of selection

Moran Birth-death processes are stochastic processes defined as follows. Consider a connected graph GG and a parameter r∈Rr \in \mathbb{R} strictly greater than 11. We start with a partition of the vertices of GG into two types: mutant vertices, that have fitness rr, and resident vertices, that have fitness 11. At each step, a random vertex is chosen with probability proportional to its fitness, and spreads its type to an adjacent vertex chosen uniformly at random. With probability 11, the process eventually reaches either fixation of the mutation (all the vertices are mutant) or extinction (all the vertices are resident). The fixation probability of a vertex vv of GG is the probability that the process starting with a single mutant at vv eventually reaches fixation. The fixation probability of each vertex of the complete graph on n∈Nn\in \mathbb{N} vertices is

pn=1−r−11−r−n. p_n = \frac{1-r^{-1}}{1-r^{-n}}.

Open problem: Does there exist a connected graph GG with n∈Nn \in \mathbb{N} vertices such that the fixation probability of each vertex of GG is strictly greater than pnp_n?

Coming soon

Organizer

Boyuan Wang portraitBoyuan Wang
Minghan Wang portraitMinghan Wang
Bochao Li portraitBochao Li
Hongwei Hu portraitHongwei Hu