Related papers: The grapheme-valued Wright-Fisher diffusion with m…

The increasing availability of population-level allele frequency data across one or more related populations necessitates the development of methods that can efficiently estimate population genetics parameters, such as the strength of…

We provide a general mathematical framework based on the theory of graphical models to study admixture graphs. Admixture graphs are used to describe the ancestral relationships between past and present populations, allowing for population…

Assume that one observes the $k$th, $2k$th$,\ldots,nk$th value of a Markov chain $X_{1,h},\ldots,X_{nk,h}$. That means we assume that a high frequency Markov chain runs in the background on a very fine time grid but that it is only observed…

The aim of this work is to provide a rigorous mathematical analysis of a stochastic concatenation model presented by Sobottka and Hart (2011) which allows approximation of the first-order stochastic structure in bacterial DNA by means of a…

The Fleming-Viot measure-valued diffusion is a Markov process describing the evolution of (allelic) types under mutation, selection and random reproduction. We enrich this process by genealogical relations of individuals so that the random…

Traditional clustering algorithms often struggle to capture the complex relationships within graphs and generalise to arbitrary clustering criteria. The emergence of graph neural networks (GNNs) as a powerful framework for learning…

The existence of global nonnegative martingale solutions to cross-diffusion systems of Shigesada-Kawasaki-Teramoto type with multiplicative noise is proven. The model describes the stochastic segregation dynamics of an arbitrary number of…

We consider a diffusion given by a small noise perturbation of a dynamical system driven by a potential function with a finite number of local minima. The classical results of Freidlin and Wentzell show that the time this diffusion spends…

Probabilistic generative models based on measure transport, such as diffusion and flow-based models, are often formulated in the language of Markovian stochastic dynamics, where the choice of the underlying process impacts both algorithmic…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

We study the limiting behaviour of the empirical measure of a system of diffusions interacting through their ranks when the number of diffusions tends to infinity. We prove that the limiting dynamics is given by a McKean-Vlasov evolution…

The Wright-Fisher model, originating in Wright (1931) is one of the canonical probabilistic models used in mathematical population genetics to study how genetic type frequencies evolve in time. In this paper we bound the rate of convergence…

We construct a new class of infinite-dimensional diffusions taking values in a generalized Kingman simplex. Our model describes the temporal evolution of the relative frequencies of infinitely-many types which are "labeled" by an arbitrary…

Product-form stationary distributions in Markov chains have been a foundational advance and driving force in our understanding of stochastic systems. In this paper, we introduce a new product-form relationship that we call "graph-based…

We consider a nonlocal evolution equation representing the continuum limit of a large ensemble of interacting particles on graphs forced by noise. The two principle ingredients of the continuum model are a nonlocal term and Q-Wiener process…

We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…

The goal of this paper is to analyze distributional Markov Decision Processes as a class of control problems in which the objective is to learn policies that steer the distribution of a cumulative reward toward a prescribed target law,…

Diffusion models have established themselves as state-of-the-art generative models across various data modalities, including images and videos, due to their ability to accurately approximate complex data distributions. Unlike traditional…

Diffusion models (DMs) are a class of generative machine learning methods that sample a target distribution by transforming samples of a trivial (often Gaussian) distribution using a learned stochastic differential equation. In standard…

In this paper we consider large state space continuous time Markov chains (MCs) arising in the field of systems biology. For density dependent families of MCs that represent the interaction of large groups of identical objects, Kurtz has…