Related papers: Pathwise construction of tree-valued Fleming-Viot …
The goal of these lectures is to review some mathematical aspects of random tree models used in evolutionary biology to model gene trees or species trees. We start with stochastic models of tree shapes (finite trees without edge lengths),…
In this work, we study a family of non-Markovian trees modeling populations where individuals live and reproduce independently with possibly time-dependent birth-rate and lifetime distribution. To this end, we use the coding process…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
The d-dimensional Lambda-Fleming-Viot generator acting on functions g(x), with x being a vector of d allele frequencies, can be written as a Wright-Fisher generator acting on functions g with a modified random linear argument of x induced…
In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability…
In this article, we analyze three classes of time-reversal of a Markov process with Gaussian noise on a manifold. We first unveil a commutativity constraint for the most general of these time-reversals to be well defined. Then we give a…
The genealogy at a single locus of a constant size $N$ population in equilibrium is given by the well-known Kingman's coalescent. When considering multiple loci under recombination, the ancestral recombination graph encodes the genealogies…
Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to…
In this work, we investigate novel algorithmic growth processes. In particular, we propose three growth operations, full doubling, RC doubling and doubling, and explore the algorithmic and structural properties of their resulting processes…
We call a random point measure infinitely ramified if for every $n\in \mathbb N$, it has the same distribution as the $n$-th generation of some branching random walk. On the other hand, branching L\'evy processes model the evolution of a…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
We prove the limit theorem for paths of random walks with $n$ steps in $\mathbb{R}^d$ as $n$ and $d$ both go to infinity. For this, the paths are viewed as finite metric spaces equipped with the $\ell_p$-metric for $p\in[1,\infty)$. Under…
We investigate the limiting behaviour of the path of random bridges treated as random sets in $\mathbb{R}^{d}$ with the Euclidean metric and the dimension $d$ increasing to infinity. The main result states that, in the square integrable…
The design space of discrete-space diffusion or flow generative models are significantly less well-understood than their continuous-space counterparts, with many works focusing only on a simple masked construction. In this work, we aim to…
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
An evolving Riemannian manifold $(M,g_t)_{t\in I}$ consists of a smooth $d$-dimensional manifold $M$, equipped with a geometric flow $g_t$ of complete Riemannian metrics, parametrized by $I=(-\infty,T)$. Given an additional $C^{1,1}$ family…
We investigate the geometrical structure of probabilistic generative dimensionality reduction models using the tools of Riemannian geometry. We explicitly define a distribution over the natural metric given by the models. We provide the…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
In this work, we give a description of all sigma-finite measures on the space of rooted compact real trees which satisfy a certain regenerative property. We show that any infinite measure which satisfies the regenerative property is the…