Related papers: Strong Amplifiers of Natural Selection: Proofs
We derive asymptotic formulae in the limit when population size N tends to infinity for mean fixation times (conditional and unconditional) in a population with two types of individuals, A and B, governed by the Moran process. We consider…
The term "strong approximation" is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic,…
Evolution occurs in populations of reproducing individuals. It is well known that population structure can affect evolutionary dynamics. Traditionally, natural selection is studied between mutants that differ in reproductive rate, but are…
We prove the existence of a limit shape and give its explicit description for certain probability distribution on signatures (or highest weights for unitary groups). The distributions have representation theoretic origin-they encode…
An \emph{evolving Shelah-Spencer process} is one by which a random graph grows, with at each time $\tau \in {\bf N}$ a new node incorporated and attached to each previous node with probability $\tau^{-\alpha}$, where $\alpha \in (0,1)…
The formula for the probability of fixation of a new mutation is widely used in theoretical population genetics and molecular evolution. Here we derive a series of identities, inequalities and approximations for the exact probability of…
The ``sample amplification'' problem formalizes the following question: Given $n$ i.i.d. samples drawn from an unknown distribution $P$, when is it possible to produce a larger set of $n+m$ samples which cannot be distinguished from $n+m$…
We describe models of single-field inflation with small and sharp step features in the potential (and sound speed) of the inflaton field, in the context of the Effective Field Theory of Inflation. This approach allows us to study the…
We consider a preferential attachment random graph with self-reinforcement. Each time a new vertex comes in, it attaches itself to an old vertex with a probability that is proportional to the sum of the degrees of that old vertex at all…
Past studies on the local limit of maximal weight matchings in edge-weighted large random graphs rely fundamentally on the assumption that the weights are atomless, which ensures that the maximal weight matching is unique. This excludes de…
We propose a model for evolutionary game dynamics with three strategies $A$, $B$ and $C$ in the framework of Moran process in finite populations. The model can be described as a stochastic process which can be numerically computed from a…
Temporal environmental variations are ubiquitous in nature, yet most of the theoretical works in population genetics and evolution assume fixed environment. Here we analyze the effect of variations in carrying capacity on the fate of a…
We introduce randomized zero forcing (RZF), a stochastic color-change process on directed graphs in which a white vertex turns blue with probability equal to the fraction of its incoming neighbors that are blue. Unlike probabilistic zero…
We study evolutionary dynamics on graphs in which each step consists of one birth and one death, also known as the Moran processes. There are two types of individuals: residents with fitness $1$ and mutants with fitness $r$. Two standard…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
Standard CMB analysis assumes a direct deterministic mapping between the multipole probed by the CMB $\ell$ and the primordial wavenumber $k$. Since the recombination era has a finite duration, this mapping is probabilistic by construction.…
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
In majority voting dynamics, a group of $n$ agents in a social network are asked for their preferred candidate in a future election between two possible choices. At each time step, a new poll is taken, and each agent adjusts their vote…
Suppose we have randomized decision trees for an outer function $f$ and an inner function $g$. The natural approach for obtaining a randomized decision tree for the composed function $(f\circ g^n)(x^1,\ldots,x^n)=f(g(x^1),\ldots,g(x^n))$…