Related papers: Fixation probability on clique-based graphs
We study the influence of complex graphs on the metastability and fixation properties of a set of evolutionary processes. In the framework of evolutionary game theory, where the fitness and selection are frequency-dependent and vary with…
The relative fixity of a permutation group is the maximum proportion of the points fixed by a non-trivial element of the group and the relative fixity of a graph is the relative fixity of its automorphism group, viewed as a permutation…
Natural microbial populations often have complex spatial structures. This can impact their evolution, in particular the ability of mutants to take over. While mutant fixation probabilities are known to be unaffected by sufficiently…
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…
In this paper we investigate geometric properties of graphs generated by a preferential attachment random graph model with edge-steps. More precisely, at each time $t\in\mathbb{N}$, with probability $p$ a new vertex is added to the graph (a…
Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described my the Moran process. Recently, this approach has been generalized in \cite{LHN} by arranging individuals on the nodes of a…
We analyze a dynamic random undirected graph in which newly added vertices are connected to those already present in the graph either using, with probability $p$, an anti-preferential attachment mechanism or, with probability $1-p$, a…
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 study evolutionary dynamics on graphs in which each step consists of one birth and one death, also known as the Moran processes. There are two types of individuals: residents with fitness $1$ and mutants with fitness $r$. Two standard…
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…
In an adapted population of mutators in which most mutations are deleterious, a nonmutator that lowers the mutation rate is under indirect selection and can sweep to fixation. Using a multitype branching process, we calculate the fixation…
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…
Population structure can have a significant effect on evolution. For some systems with sufficient symmetry, analytic results can be derived within the mathematical framework of evolutionary graph theory which relate to the outcome of the…
A central question of evolutionary dynamics on graphs is whether or not a mutation introduced in a population of residents survives and eventually even spreads to the whole population, or gets extinct. The outcome naturally depends on the…
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 well-known Isothermal Theorem was introduced in a Nature Communications article in 2005 and has since contributed to the creation of the rich field of evolutionary graph theory. The theorem states under which conditions certain…
Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set ${\cal H}$ of forbidden induced subgraphs. We initiate a…
Random constraint satisfaction problems can exhibit a phase where the number of constraints per variable $\alpha$ makes the system solvable in theory on the one hand, but also makes the search for a solution hard, meaning that common…
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 propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…