SearcharxivSearch

arXiv subjects

Frederic Alberti

Publications and source records attributed to Frederic Alberti.

8 recordsLinked to original sources

A conditional coalescent for diploid exchangeable population models given the pedigree

We study coalescent processes conditional on the population pedigree under the exchangeable diploid bi-parental population model of \citet{BirknerEtAl2018}. While classical coalescent models average over all reproductive histories, thereby marginalizing the pedigree, our work analyzes the genealogical structure embedded within a fixed pedigree generated by the diploid Cannings model. In the large-population limit, we show that these conditional coalescent processes differ significantly from their marginal counterparts when the marginal coalescent process includes multiple mergers. We characterize the limiting process as an inhomogeneous $(\Psi,c)$-coalescent, where $\Psi$ encodes the timing and scale of multiple mergers caused by generations with large individual progeny (GLIPs), and $c$ is a constant rate governing binary mergers. Our results reveal fundamental distinctions between quenched (conditional) and annealed (classical) genealogical models, demonstrate how the fixed pedigree structure impacts multi-locus statistics such as the site-frequency spectrum, and have implications for interpreting patterns of genetic variation among unlinked loci in the genomes of sampled individuals. They significantly extend the results of \citet{DiamantidisEtAl2024}, which considered a sample of size two under a specific Wright-Fisher model with a highly reproductive couple, and those of \citet{TyukinThesis2015}, where Kingman coalescent was the limiting process. Our proofs adapt coupling techniques from the theory of random walks in random environments.

math.PR

On the block size spectrum of a class of exchangeable dynamic random graphs

In this work we introduce the dynamic $\Theta$-random graph and the associated $\Theta$-coalescent with momentum. Dynamic $\Theta$-random graphs are a subclass of exchangeable and consistent random graph processes, parametrised by a measure $\Theta$ on $[0,1]\times (0,1]$, inspired by the classic $\Lambda$-coalescent from mathematical population genetics. The $\Theta$-coalescent with momentum accounts for the small connected components of this graph; in contrast to the underlying random graph it is exchangeable but not consistent. Our main results specialise on the case where $\Theta$ is the product of a beta measure and a Dirac mass at $1$. We prove a dynamic law of large numbers for the block size spectrum, which tracks the numbers of blocks containing $1,...,d$ elements. On top of that, we provide a functional limit theorem for the fluctuations. The limit process satisfies a stochastic differential equation of Ornstein-Uhlenbeck type.

math.PR

Asymptotic sampling distributions made easy: loose linkage in the ancestral recombination graph

Understanding the interplay between recombination and resampling is a significant challenge in mathematical population genetics and of great practical relevance. Asymptotic results about the distribution of samples when recombination is strong compared to resampling are often based on the approximate solution of certain recursions, which is technically hard and offers little conceptual insight. This work generalises an elegant probabilistic argument, based on the coupling of ancestral processes but so far only available in the case of two sites, to the multilocus setting. This offers an alternative route to, and slightly generalises, a classical result of Bhaskar and Song.

math.PR

Labelled partitions in action: recombination, selection, mutation, and more

In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modelled by a measure-valued ordinary differential equation. We provide a stochastic representation for the solution of this model via duality to a new labelled partitioning process with Markovian labels. In the special case of single-crossover, this leads to a recursive solution formula. This extends (and unifies) previous results on the selection-recombination equation. As a concrete example, we consider the selection-mutation-recombination equation.

math.PR

Solving the migration-recombination equation from a genealogical point of view

We consider the discrete-time migration-recombination equation, a deterministic, nonlinear dynamical system that describes the evolution of the genetic type distribution of a population evolving under migration and recombination in a law of large numbers setting. We relate this dynamics (forward in time) to a Markov chain, namely a labelled partitioning process, backward in time. This way, we obtain a stochastic representation of the solution of the migration-recombination equation. As a consequence, one obtains an explicit solution of the nonlinear dynamics, simply in terms of powers of the transition matrix of the Markov chain. Finally, we investigate the limiting and quasi-limiting behaviour of the Markov chain, which gives immediate access to the asymptotic behaviour of the dynamical system. We finally sketch the analogous situation in continuous time.

math.PR

Selection, recombination, and the ancestral initiation graph

Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by means of the ancestral selection-recombination graph. Here, we introduce a more accessible approach, namely the ancestral initiation graph. The construction is based on a discretisation of the selection-recombination equation. We apply our method to systematically explain a long-standing observation concerning the dynamics of linkage disequilibrium between two neutral loci hitchhiking along with a selected one. In particular, this clarifies the nontrivial dependence on the position of the selected site.

q-bio.PE

Genetic recombination as a Generalised Gradient Flow

It is well known that the classical recombination equation for two parent individuals is equivalent to the law of mass action of a strongly reversible chemical reaction network, and can thus be reformulated as a generalised gradient system. Here, this is generalised to the case of an arbitrary number of parents. Furthermore, the gradient structure of the backward-time partitioning process is investigated.

math.DS

Solving the selection-recombination equation: Ancestral lines under selection and recombination

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. So far, an explicit solution has seemed out of reach; 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. We use both an analytical and a probabilistic, genealogical approach for the case of an \emph{arbitrary} number of neutral sites linked to one selected site. This leads to a recursive integral representation of the solution. Starting from a variant of the ancestral selection-recombination graph, we develop an efficient genealogical structure, which may, equivalently, be represented as a weighted partitioning process, a family of Yule processes with initiation and resetting, and a family of initiation processes. We prove them to be dual to the solution of the differential equation forward in time and thus obtain a stochastic representation of the deterministic solution, along with the Markov semigroup in closed form.

math.PR