Strong Amplifiers of Natural Selection: Proofs

02/07/2018
by   Andreas Pavlogiannis, et al.
0

We consider the modified Moran process on graphs to study the spread of genetic and cultural mutations on structured populations. An initial mutant arises either spontaneously (aka uniform initialization), or during reproduction (aka temperature initialization) in a population of n individuals, and has a fixed fitness advantage r>1 over the residents of the population. The fixation probability is the probability that the mutant takes over the entire population. Graphs that ensure fixation probability of 1 in the limit of infinite populations are called strong amplifiers. Previously, only a few examples of strong amplifiers were known for uniform initialization, whereas no strong amplifiers were known for temperature initialization. In this work, we study necessary and sufficient conditions for strong amplification, and prove negative and positive results. We show that for temperature initialization, graphs that are unweighted and/or self-loop-free have fixation probability upper-bounded by 1-1/f(r), where f(r) is a function linear in r. Similarly, we show that for uniform initialization, bounded-degree graphs that are unweighted and/or self-loop-free have fixation probability upper-bounded by 1-1/g(r,c), where c is the degree bound and g(r,c) a function linear in r. Our main positive result complements these negative results, and is as follows: every family of undirected graphs with (i) self loops and (ii) diameter bounded by n^1-ϵ, for some fixed ϵ>0, can be assigned weights that makes it a strong amplifier, both for uniform and temperature initialization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2019

Cops and Robbers on graphs of bounded diameter

The game of Cops and Robbers is a well known game played on graphs. In t...
research
10/19/2017

Mutants and Residents with Different Connection Graphs in the Moran Process

The Moran process, as studied by Lieberman et al. [L05], is a stochastic...
research
06/21/2017

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

Evolutionary graph theory studies the evolutionary dynamics in a populat...
research
11/04/2021

Computational thresholds for the fixed-magnetization Ising model

The ferromagnetic Ising model is a model of a magnetic material and a ce...
research
01/11/2022

Sufficient conditions for perfect mixed tilings

We develop a method to study sufficient conditions for perfect mixed til...
research
02/10/2022

Three-dimensional graph products with unbounded stack-number

We prove that the stack-number of the strong product of three n-vertex p...
research
03/16/2022

The Degree-Rips Complexes of an Annulus with Outliers

The degree-Rips bifiltration is the most computable of the parameter-fre...

Please sign up or login with your details

Forgot password? Click here to reset