Related papers: Fixation probability on clique-based graphs
The Moran process is a random process that models the spread of genetic mutations through graphs. If the graph is connected, the process eventually reaches "fixation", where every vertex is a mutant, or "extinction", where no vertex is a…
This paper is based on the complete classification of evolutionary scenarios for the Moran process with two strategies given by Taylor et al. (B. Math. Biol. 66(6): 1621--1644, 2004). Their classification is based on whether each strategy…
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 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…
Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate $r$ which invades a population of residents. We say that the fixation…
The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation…
We study fixation probabilities for the Moran stochastic process for the evolution of a population with three or more types of individuals and frequency-dependent fitnesses. Contrarily to the case of populations with two types of…
Broom and Rycht\'{a}\v{r} [Proc. R. Soc. A (2008) 464, 2609--2627] found an exact solution for the fixation probabilities of the Moran process for a structured population, in which the interaction structure among individuals is given by the…
Different evolutionary models are known to make disparate predictions for the success of an invading mutant in some situations. For example, some evolutionary mechanics lead to amplification of selection in structured populations, while…
One of the most fundamental concepts of evolutionary dynamics is the "fixation" probability, i.e. the probability that a mutant spreads through the whole population. Most natural communities are geographically structured into habitats…
This work studies the generalized Moran process, as introduced by Lieberman et al. [Nature, 433:312-316, 2005]. We introduce the parameterized notions of selective amplifiers and selective suppressors of evolution, i.e. of networks (graphs)…
We analyze evolutionary dynamics on graphs, where the nodes represent individuals of a population. The links of a node describe which other individuals can be displaced by the offspring of the individual on that node. Amplifiers of…
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,…
We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…
The formula for the probability of fixation of a new mutation is widely used in theoretical population genetics and molecular evolution. Here we derive a series of identities, inequalities and approximations for the exact probability of…
The stage of evolution is the population of reproducing individuals. The structure of the population is know to affect the dynamics and outcome of evolutionary processes, but analytical results for generic random structures have been…
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…
In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between…
We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change in the set of maximal cliques, as well as…
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights. We show that the clique number is…