Related papers: Fixation Maximization in the Positional Moran Proc…
We study the complexity of approximating the multimarginal optimal transport (MOT) distance, a generalization of the classical optimal transport distance, considered here between $m$ discrete probability distributions supported each on $n$…
Population structure and spatial heterogeneity are integral components of evolutionary dynamics, in general, and of evolution of cooperation, in particular. Structure can promote the emergence of cooperation in some populations and suppress…
The aim of this paper is to study the large population limit of a binary branching particle system with Moran type interactions: we introduce a new model where particles evolve, reproduce and die independently and, with a probability that…
We study a stochastic differential equation driven by a Poisson point process, which models continuous changes in a population's environment, as well as the stochastic fixation of beneficial mutations that might compensate for this change.…
Online models that allow recourse are highly effective in situations where classical models are too pessimistic. One such problem is the online machine covering problem on identical machines. In this setting, jobs arrive one by one and must…
Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the NP-hard graph partitioning problem. We discuss the scaling behavior of extremal…
Within the germinal center in follicles, B-cells proliferate, mutate and differentiate, while being submitted to a powerful selection~: a micro-evolutionary mechanism at the heart of adaptive immunity. A new foreign pathogen is confronted…
The goal of this article is to study the limit of the empirical distribution induced by a mutation-selection multi-allelic Moran model, whose dynamic is given by a continuous-time irreducible Markov chain. The rate matrix driving the…
We are interested in the invasion phase for stochastic processes with interactions when a single mutant with positive fitness arrives in a resident population at equilibrium. By a now classic approach, the first stage of the invasion is…
We study the problem of bounding path-dependent expectations (within any finite time horizon $d$) over the class of discrete-time martingales whose marginal distributions lie within a prescribed tolerance of a given collection of benchmark…
As an important part of genetic algorithms (GAs), mutation operators is widely used in evolutionary algorithms to solve $\mathcal{NP}$-hard problems because it can increase the population diversity of individual. Due to limitations in…
The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$…
In this paper we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of Differential Evolution is derived. It is then demonstrated that, under some assumptions on the…
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…
Modular reconfigurable manipulators enable quick adaptation and versatility to address different application environments and tailor to the specific requirements of the tasks. Task performance significantly depends on the manipulator's…
Muller's ratchet, in its prototype version, models a haploid, asexual population whose size~$N$ is constant over the generations. Slightly deleterious mutations are acquired along the lineages at a constant rate, and individuals carrying…
The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last…
Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) have brought a new perspective on obtaining upper and lower…
Strategies aimed at reducing the negative effects of long-term uncertainty and risk are common in biology, game theory, and finance, even if they entail a cost in terms of mean benefit. Here, we focus on the single mutant's invasion of a…
Multimarginal Optimal Transport (MOT) is the problem of linear programming over joint probability distributions with fixed marginals. A key issue in many applications is the complexity of solving MOT: the linear program has exponential size…