Events Archive

The selection-recombination equation and its solution The deterministic selection-recombination equation describes the evolution of the genetic type composition of a population under selection and recombination in a law of large numbers regime. This equation is notoriously difficult to solve; only in the special case of three sites with selection acting on one of them has an approximate solution been found, but without an obvious path to generalisation. The matter finally became transparent by considering a dual ancestral process which combines the ancestral recombination graph with the ancestral selection graph. This approach led to an explicit solution of the selection-recombination equation, in the special case of one selected site linked to arbitrarily many neutral sites. In this talk, I will discuss a related approach based on a discretisation scheme, along with an application to genetic hitchhiking.

Zoom Link can be obtained at stochastik@uni-mainz.de