Related papers: The grapheme-valued Wright-Fisher diffusion with m…
In this paper, we consider a mathematical model for the evolution of neutral genetic diversity in a spatial continuum including mutations, genetic drift and either short range or long range dispersal. The model we consider is the spatial $…
A population genetics model based on a multitype branching process, or equivalently a Galton-Watson branching process for multiple alleles, is pre- sented. The diffusion limit forward Kolmogorov equation is derived for the case of neutral…
This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
This paper investigates Gaussian Markov random field approximations to nonstationary Gaussian fields using graph representations of stochastic partial differential equations. We establish approximation error guarantees building on the…
Consider a two-type Moran population of size $N$ with selection and mutation, where the selective advantage of the fit individuals is amplified at extreme environmental conditions. Assume selection and mutation are weak with respect to $N$,…
We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sampling $k$-colorings of a sparse random graph $G(n,d/n)$ for constant $d$. The best known rapid mixing results for general graphs are in…
We give a pathwise construction of a two-parameter family of purely-atomic-measure-valued diffusions in which ranked masses of atoms are stationary with the Poisson-Dirichlet$(\alpha,\theta)$ distributions, for $\alpha\in (0,1)$ and…
We study the difference between the probability density of a random variable $F$ on Markov diffusion chaos and the probability density of a general target distribution $Z$. In the special case where $F$ is a chaotic random variables and $Z$…
The dynamics of information diffusion within graphs is a critical open issue that heavily influences graph representation learning, especially when considering long-range propagation. This calls for principled approaches that control and…
We define two algorithms for propagating information in classification problems with pairwise relationships. The algorithms are based on contraction maps and are related to non-linear diffusion and random walks on graphs. The approach is…
We introduce the Space-Time Markov Chain Approximation (STMCA) for a general diffusion process on a finite metric graph $\Gamma$. The STMCA is a doubly asymmetric (in both time and space) random walk defined on a subdivisions of $\Gamma$,…
A random walk on a directed graph gives a Markov chain on the vertices of the graph. An important question that arises often in the context of Markov chain is whether the uniform distribution on the vertices of the graph is a stationary…
Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…
Mathematically modelling diffusive and advective transport of particles in heterogeneous layered media is important to many applications in computational, biological and medical physics. While deterministic continuum models of such…
The paper deals with a certain class of random evolutions. We develop a construction that yields an invariant measure for a continuous-time Markov process with random transitions. The approach is based on a particular way of constructing…
Transporting between arbitrary distributions is a fundamental goal in generative modeling. Recently proposed diffusion bridge models provide a potential solution, but they rely on a joint distribution that is difficult to obtain in…
Climate change is reshaping species interactions and movement across fragmented landscapes. Despite this, most mathematical models assume random diffusion, overlooking the influence of directed movement. Here, we develop a graph based…
In this work, we establish a direct connection between generative diffusion models (DMs) and stochastic quantization (SQ). The DM is realized by approximating the reversal of a stochastic process dictated by the Langevin equation,…
Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…