Related papers: Exact numerical calculation of fixation probabilit…
We consider a generalized version of the birth-death (BD) and death-birth (DB) processes introduced by Kaveh, Komarova, and Kohandel (2015), in which two constant fitnesses, one for birth and the other for death, describe the selection…
We consider the modified Moran process on graphs to study the spread of genetic and cultural mutations on structured populations. An initial mutant arises either spontaneously (aka \emph{uniform initialization}), or during reproduction (aka…
The Wright-Fisher model and the Moran model are both widely used in population genetics. They describe the time evolution of the frequency of an allele in a well-mixed population with fixed size. We propose a simple and tractable model…
The spatial structure of an evolving population affects which mutations become fixed. Some structures amplify selection, increasing the likelihood that beneficial mutations become fixed while deleterious mutations do not. Other structures…
Moran Birth-death process is a standard stochastic process that is used to model natural selection in spatially structured populations. A newly occurring mutation that invades a population of residents can either fixate on the whole…
We construct a deterministic approximation algorithm for computing a permanent of a $0,1$ $n$ by $n$ matrix to within a multiplicative factor $(1+\epsilon)^n$, for arbitrary $\epsilon>0$. When the graph underlying the matrix is a constant…
Fixation probabilities are essential for characterizing stochastic evolutionary dynamics, but analytical results remain limited mainly to systems with two competing types. We develop a perturbative framework to compute fixation…
We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithms suffer from high…
The Moran process is a classic stochastic process that models the rise and takeover of novel traits in network-structured populations. In biological terms, a set of mutants, each with fitness $m\in(0,\infty)$ invade a population of…
We study two of the simple rules on finite graphs under the death-birth updating and the imitation updating discovered by Ohtsuki, Hauert, Lieberman and Nowak [Nature 441 (2006) 502-505]. Each rule specifies a payoff-ratio cutoff point for…
We construct an individual-based metapopulation model of population genetics featuring migration, mutation, selection and genetic drift. In the case of a single `island', the model reduces to the Moran model. Using the diffusion…
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…
Metric graphs are structures obtained by associating edges in a standard graph with segments of the real line and gluing these segments at the vertices of the graph. The resulting structure has a natural metric that allows for the study of…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…
The dynamical mechanisms that can stabilize the coexistence of species (or strategies) are of substantial interest for the maintenance of biodiversity and in sociobehavioural dynamics. We investigate the mean extinction time in the…
Calculating the permanent of a (0,1) matrix is a #P-complete problem but there are some classes of structured matrices for which the permanent is calculable in polynomial time. The most well-known example is the fixed-jump (0,1) circulant…
To our knowledge, the populations are generally assumed to be homogeneous in the traditional approach to evolutionary game dynamics. Here, we focus on the inhomogeneous populations. A simple model which can describe the inhomogeneity of the…
Studies of fixation dynamics in Markov processes predominantly focus on the mean time to absorption. This may be inadequate if the distribution is broad and skewed. We compute the distribution of fixation times in one-step birth-death…
We study stochastic evolutionary game dynamics in a population of finite size. Individuals in the population are divided into two dynamically evolving groups. The structure of the population is formally described by a Wright-Fisher type…