Related papers: Fixation probability in Moran-like Processes on gr…
In evolutionary dynamics, the probability that a mutation spreads through the whole population, having arisen in a single individual, is known as the fixation probability. In general, it is not possible to find the fixation probability…
We define the Sampled Moran Genealogy Process, a continuous-time Markov process on the space of genealogies with the demography of the classical Moran process, sampled through time. To do so, we begin by defining the Moran Genealogy Process…
We present simpler algorithms for two closely related morphing problems, both based on the barycentric interpolation paradigm introduced by Floater and Gotsman, which is in turn based on Floater's asymmetric extension of Tutte's classical…
In nature, most microbial populations have complex spatial structures that can affect their evolution. Evolutionary graph theory predicts that some spatial structures modelled by placing individuals on the nodes of a graph affect the…
In evolutionary dynamics, a key measure of a mutant trait's success is the probability that it takes over the population given some initial mutant-appearance distribution. This "fixation probability" is difficult to compute in general, as…
Population structures can be crucial determinants of evolutionary processes. For the Moran process on graphs certain structures suppress selective pressure, while others amplify it (Lieberman et al. 2005 Nature 433 312-316). Evolutionary…
These notes originated in a series of lectures I gave in Marseille in May, 2013. I was invited to give an introduction to the isomorphism theorems, originating with Dynkin, which connect Markov local times and Gaussian processes. This is an…
This paper generalizes isomorph theory to systems that are not in thermal equilibrium. The systems are assumed to be R-simple, i.e., have a potential energy that as a function of all particle coordinates $\textbf{R}$ obeys the…
Understanding how natural selection unfolds across space and time is a central problem in evolutionary biology. Classic models such as the Moran process capture stochastic birth-death dynamics in structured populations, while…
We present local mappings that relate the marginal probabilities of a global probability mass function represented by its primal normal factor graph to the corresponding marginal probabilities in its dual normal factor graph. The mapping is…
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property that is closed under conditioning and marginalization. By…
We present a general formalism which allows us to derive the evolution equations describing one-dimensional (1D) and isotropic 2D interfacelike systems, that is based on symmetries, conservation laws, multiple scale arguments, and exploits…
This paper introduces graphemes for constructing and analyzing stochastic processes that describe the evolution of large dynamic graphs. Unlike graphons, which capture the static properties of dense graphs via exchangeability or subgraph…
We consider the Moran model in continuous time with two types, mutation, and selection. We concentrate on the ancestral line and its stationary type distribution. Building on work by Fearnhead (J. Appl. Prob. 39 (2002), 38-54) and Taylor…
We consider a multi-type Moran model (in continuous time) with selection and type-dependent mutation. This paper is concerned with the evolution of genealogical information forward in time. For this purpose we define and analytically…
The density hypothesis on random times becomes now a standard in modeling of risks. One of the basic reasons to introduce the density hypothesis is the desire to have a computable credit risk model. However, recent work shows that merely an…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
Mean-field frozen percolation is a random graph-valued process, which adjusts the dynamics of the classical Erdos-Renyi process with an additional mechanism to 'freeze' potential giant components before they can form. It is known to exhibit…
The Moran process, as studied by Lieberman, Hauert and Nowak, is a randomised algorithm modelling the spread of genetic mutations in populations. The algorithm runs on an underlying graph where individuals correspond to vertices. Initially,…
A theory for the structure of isothermal, self-gravitating gas spheres in pressure equilibrium in a softened gravitational field is developed. The one parameter spline softening proposed by Hernquist & Katz (1989) is used. We show that the…