Related papers: Strong Bounds for Evolution in Undirected Graphs
Coevolving and competing species or game-theoretic strategies exhibit rich and complex dynamics for which a general theoretical framework based on finite populations is still lacking. Recently, an explicit mean-field description in the form…
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…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We consider the Moran process with two populations competing under an iterated Prisoners' Dilemma in the presence of mutation, and concentrate on the case where there are multiple Evolutionarily Stable Strategies. We perform a complete…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
We propose a model for evolutionary game dynamics with three strategies $A$, $B$ and $C$ in the framework of Moran process in finite populations. The model can be described as a stochastic process which can be numerically computed from a…
Deriving generalization bounds for stable algorithms is a classical question in learning theory taking its roots in the early works by Vapnik and Chervonenkis (1974) and Rogers and Wagner (1978). In a series of recent breakthrough papers by…
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with…
Evolutionary models on graphs, as an extension of the Moran process, have two major implementations: birth-death (BD) models (or the invasion process) and death- birth (DB) models (or voter models). The isothermal theorem states that the…
We describe systems using Kauffman and similar networks. They are directed funct ioning networks consisting of finite number of nodes with finite number of discr ete states evaluated in synchronous mode of discrete time. In this paper we…
We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…
In this paper, we study the absorption and fixation times for evolutionary processes on graphs, under different updating rules. While in Moran process a single neighbour is randomly chosen to be replaced, in proliferation processes other…
The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants.…
We prove risk bounds for binary classification in high-dimensional settings when the sample size is allowed to be smaller than the dimensionality of the training set observations. In particular, we prove upper bounds for both 'compressive…
We reconsider the Moran model in continuous time with population size $N$, two allelic types, and selection. We introduce a new particle representation, which we call the labelled Moran model, and which has the same distribution of type…
We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter $\alpha$ which governs the strength of the reinforcement, and a collection of Poisson processes indexed by the vertices of the…
We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We define the incentive process, a natural generalization of the Moran process incorporating evolutionary updating mechanisms corresponding to well-known evolutionary dynamics, such as the logit, projection, and best-reply dynamics.…
Temporal environmental variations are ubiquitous in nature, yet most of the theoretical works in population genetics and evolution assume fixed environment. Here we analyze the effect of variations in carrying capacity on the fate of a…