Mutators can drive the evolution of multi-resistance to antibiotics.

Antibiotic combination therapies are an approach used to counter the evolution of resistance; their purported benefit is they can stop the successive emergence of independent resistance mutations in the same genome. Here, we show that bacterial populations with 'mutators', organisms with defects in DNA repair, readily evolve resistance to combination antibiotic treatment when there is a delay in reaching inhibitory concentrations of antibiotic-under conditions where purely wild-type populations cannot. In populations of Escherichia coli subjected to combination treatment, we detected a diverse array of acquired mutations, including multiple alleles in the canonical targets of resistance for the two drugs, as well as mutations in multi-drug efflux pumps and genes involved in DNA replication and repair. Unexpectedly, mutators not only allowed multi-resistance to evolve under combination treatment where it was favoured, but also under single-drug treatments. Using simulations, we show that the increase in mutation rate of the two canonical resistance targets is sufficient to permit multi-resistance evolution in both single-drug and combination treatments. Under both conditions, the mutator allele swept to fixation through hitch-hiking with single-drug resistance, enabling subsequent resistance mutations to emerge. Ultimately, our results suggest that mutators may hinder the utility of combination therapy when mutators are present. Additionally, by raising the rates of genetic mutation, selection for multi-resistance may have the unwanted side-effect of increasing the potential to evolve resistance to future antibiotic treatments.

Breakdown of Random-Matrix Universality in Persistent Lotka-Volterra Communities.

The eigenvalue spectrum of a random matrix often only depends on the first and second moments of its elements, but not on the specific distribution from which they are drawn. The validity of this universality principle is often assumed without proof in applications. In this Letter, we offer a pertinent counterexample in the context of the generalized Lotka-Volterra equations. Using dynamic mean-field theory, we derive the statistics of the interactions between species in an evolved ecological community. We then show that the full statistics of these interactions, beyond those of a Gaussian ensemble, are required to correctly predict the eigenvalue spectrum and therefore stability. Consequently, the universality principle fails in this system. We thus show that the eigenvalue spectra of random matrices can be used to deduce the stability of "feasible" ecological communities, but only if the emergent non-Gaussian statistics of the interactions between species are taken into account.

Eigenvalues of Random Matrices with Generalized Correlations: A Path Integral Approach.

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical systems. In this Letter, we study the eigenvalue spectrum of an ensemble of random matrices with correlations between any pair of elements. To this end, we introduce an analytical method that maps the resolvent of the random matrix onto the response functions of a linear dynamical system. The response functions are then evaluated using a path integral formalism, enabling us to make deductions about the eigenvalue spectrum. Our central result is a simple, closed-form expression for the leading eigenvalue of a large random matrix with generalized correlations. This formula demonstrates that correlations between matrix elements that are not diagonally opposite, which are often neglected, can have a significant impact on stability.

Network meta-analysis and random walks.

Network meta-analysis (NMA) is a central tool for evidence synthesis in clinical research. The results of an NMA depend critically on the quality of evidence being pooled. In assessing the validity of an NMA, it is therefore important to know the proportion contributions of each direct treatment comparison to each network treatment effect. The construction of proportion contributions is based on the observation that each row of the hat matrix represents a so-called "evidence flow network" for each treatment comparison. However, the existing algorithm used to calculate these values is associated with ambiguity according to the selection of paths. In this article, we present a novel analogy between NMA and random walks. We use this analogy to derive closed-form expressions for the proportion contributions. A random walk on a graph is a stochastic process that describes a succession of random "hops" between vertices which are connected by an edge. The weight of an edge relates to the probability that the walker moves along that edge. We use the graph representation of NMA to construct the transition matrix for a random walk on the network of evidence. We show that the net number of times a walker crosses each edge of the network is related to the evidence flow network. By then defining a random walk on the directed evidence flow network, we derive analytically the matrix of proportion contributions. The random-walk approach has none of the associated ambiguity of the existing algorithm.

Analytical and Numerical Treatment of Continuous Ageing in the Voter Model.

The conventional voter model is modified so that an agent's switching rate depends on the 'age' of the agent-that is, the time since the agent last switched opinion. In contrast to previous work, age is continuous in the present model. We show how the resulting individual-based system with non-Markovian dynamics and concentration-dependent rates can be handled both computationally and analytically. The thinning algorithm of Lewis and Shedler can be modified in order to provide an efficient simulation method. Analytically, we demonstrate how the asymptotic approach to an absorbing state (consensus) can be deduced. We discuss three special cases of the age-dependent switching rate: one in which the concentration of voters can be approximated by a fractional differential equation, another for which the approach to consensus is exponential in time, and a third case in which the system reaches a frozen state instead of consensus. Finally, we include the effects of a spontaneous change of opinion, i.e., we study a noisy voter model with continuous ageing. We demonstrate that this can give rise to a continuous transition between coexistence and consensus phases. We also show how the stationary probability distribution can be approximated, despite the fact that the system cannot be described by a conventional master equation.

Switching environments, synchronous sex, and the evolution of mating types.

While facultative sex is common in sexually reproducing species, for reasons of tractability most mathematical models assume that such sex is asynchronous in the population. In this paper, we develop a model of switching environments to instead capture the effect of an entire population transitioning synchronously between sexual and asexual modes of reproduction. We use this model to investigate the evolution of the number of self-incompatible mating types in finite populations, which empirically can range from two to thousands. When environmental switching is fast, we recover the results of earlier studies that implicitly assumed populations were engaged in asynchronous sexual reproduction. However when the environment switches slowly, we see deviations from previous asynchronous theory, including a lower number of mating types at equilibrium and bimodality in the stationary distribution of mating types. We provide analytic approximations for both the fast and slow switching regimes, as well as a numerical scheme based on the Kolmogorov equations for the system to quickly evaluate the model dynamics at intermediate parameters. Our approach exploits properties of integer partitions in number theory. We also demonstrate how additional biological processes such as selective sweeps can be accounted for in this switching environment framework, showing that beneficial mutations can further erode mating type diversity in synchronous facultatively sexual populations.

Competition delays multi-drug resistance evolution during combination therapy.

Combination therapies have shown remarkable success in preventing the evolution of resistance to multiple drugs, including HIV, tuberculosis, and cancer. Nevertheless, the rise in drug resistance still remains an important challenge. The capability to accurately predict the emergence of resistance, either to one or multiple drugs, may help to improve treatment options. Existing theoretical approaches often focus on exponential growth laws, which may not be realistic when scarce resources and competition limit growth. In this work, we study the emergence of single and double drug resistance in a model of combination therapy of two drugs. The model describes a sensitive strain, two types of single-resistant strains, and a double-resistant strain. We compare the probability that resistance emerges for three growth laws: exponential growth, logistic growth without competition between strains, and logistic growth with competition between strains. Using mathematical estimates and numerical simulations, we show that between-strain competition only affects the emergence of single resistance when resources are scarce. In contrast, the probability of double resistance is affected by between-strain competition over a wider space of resource availability. This indicates that competition between different resistant strains may be pertinent to identifying strategies for suppressing drug resistance, and that exponential models may overestimate the emergence of resistance to multiple drugs. A by-product of our work is an efficient strategy to evaluate probabilities of single and double resistance in models with multiple sequential mutations. This may be useful for a range of other problems in which the probability of resistance is of interest.

Motion, fixation probability and the choice of an evolutionary process.

Seemingly minor details of mathematical and computational models of evolution are known to change the effect of population structure on the outcome of evolutionary processes. For example, birth-death dynamics often result in amplification of selection, while death-birth processes have been associated with suppression. In many biological populations the interaction structure is not static. Instead, members of the population are in motion and can interact with different individuals at different times. In this work we study populations embedded in a flowing medium; the interaction network is then time dependent. We use computer simulations to investigate how this dynamic structure affects the success of invading mutants, and compare these effects for different coupled birth and death processes. Specifically, we show how the speed of the motion impacts the fixation probability of an invading mutant. Flows of different speeds interpolate between evolutionary dynamics on fixed heterogeneous graphs and well-stirred populations; this allows us to systematically compare against known results for static structured populations. We find that motion has an active role in amplifying or suppressing selection by fragmenting and reconnecting the interaction graph. While increasing flow speeds suppress selection for most evolutionary models, we identify characteristic responses to flow for the different update rules we test. In particular we find that selection can be maximally enhanced or suppressed at intermediate flow speeds.

Effects of population growth on the success of invading mutants.

Understanding if and how mutants reach fixation in populations is an important question in evolutionary biology. We study the impact of population growth has on the success of mutants. To systematically understand the effects of growth we decouple competition from reproduction; competition follows a birth-death process and is governed by an evolutionary game, while growth is determined by an externally controlled branching rate. In stochastic simulations we find non-monotonic behaviour of the fixation probability of mutants as the speed of growth is varied; the right amount of growth can lead to a higher success rate. These results are observed in both coordination and coexistence game scenarios, and we find that the 'one-third law' for coordination games can break down in the presence of growth. We also propose a simplified description in terms of stochastic differential equations to approximate the individual-based model.

Complex dynamics in learning complicated games.

Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditionally, game theory studies the equilibria of simple games. However, is this useful if the game is complicated, and if not, what is? We define a complicated game as one with many possible moves, and therefore many possible payoffs conditional on those moves. We investigate two-person games in which the players learn based on a type of reinforcement learning called experience-weighted attraction (EWA). By generating games at random, we characterize the learning dynamics under EWA and show that there are three clearly separated regimes: (i) convergence to a unique fixed point, (ii) a huge multiplicity of stable fixed points, and (iii) chaotic behavior. In case (iii), the dimension of the chaotic attractors can be very high, implying that the learning dynamics are effectively random. In the chaotic regime, the total payoffs fluctuate intermittently, showing bursts of rapid change punctuated by periods of quiescence, with heavy tails similar to what is observed in fluid turbulence and financial markets. Our results suggest that, at least for some learning algorithms, there is a large parameter regime for which complicated strategic interactions generate inherently unpredictable behavior that is best described in the language of dynamical systems theory.

Competition for resources can explain patterns of social and individual learning in nature.

In nature, animals often ignore socially available information despite the multiple theoretical benefits of social learning over individual trial-and-error learning. Using information filtered by others is quicker, more efficient and less risky than randomly sampling the environment. To explain the mix of social and individual learning used by animals in nature, most models penalize the quality of socially derived information as either out of date, of poor fidelity or costly to acquire. Competition for limited resources, a fundamental evolutionary force, provides a compelling, yet hitherto overlooked, explanation for the evolution of mixed-learning strategies. We present a novel model of social learning that incorporates competition and demonstrates that (i) social learning is favoured when competition is weak, but (ii) if competition is strong social learning is favoured only when resource quality is highly variable and there is low environmental turnover. The frequency of social learning in our model always evolves until it reduces the mean foraging success of the population. The results of our model are consistent with empirical studies showing that individuals rely less on social information where resources vary little in quality and where there is high within-patch competition. Our model provides a framework for understanding the evolution of social learning, a prerequisite for human cumulative culture.

Gaussian approximations for stochastic systems with delay: chemical Langevin equation and application to a Brusselator system.

We present a heuristic derivation of Gaussian approximations for stochastic chemical reaction systems with distributed delay. In particular, we derive the corresponding chemical Langevin equation. Due to the non-Markovian character of the underlying dynamics, these equations are integro-differential equations, and the noise in the Gaussian approximation is coloured. Following on from the chemical Langevin equation, a further reduction leads to the linear-noise approximation. We apply the formalism to a delay variant of the celebrated Brusselator model, and show how it can be used to characterise noise-driven quasi-cycles, as well as noise-triggered spiking. We find surprisingly intricate dependence of the typical frequency of quasi-cycles on the delay period.

Ordering dynamics of nonlinear voter models.

We study the ordering dynamics of nonlinear voter models with multiple states, also providing a discussion of the two-state model. The rate with which an individual adopts an opinion scales as the qth power of the number of the individual's neighbors in that state. For q>1 the dynamics favor the opinion held by the most agents. The ordering to consensus is driven by deterministic drift, and noise plays only a minor role. For q<1 the dynamics favors minority opinions, and for multistate models the ordering proceeds through a noise-driven succession of metastable states. Unlike linear multistate systems, the nonlinear model cannot be reduced to an effective two-state model. We find that the average density of active interfaces in the model with multiple opinion states does not show a single exponential decay in time for q<1, again at variance with the linear model. This highlights the special character of the conventional (linear) voter model, in which deterministic drift is absent. As part of our analysis, we develop a pair approximation for the multistate model on graphs, valid for any positive real value of q, improving on previous approximations for nonlinear two-state voter models.

Stochastic processes with distributed delays: chemical Langevin equation and linear-noise approximation.

We develop a systematic approach to the linear-noise approximation for stochastic reaction systems with distributed delays. Unlike most existing work our formalism does not rely on a master equation; instead it is based upon a dynamical generating functional describing the probability measure over all possible paths of the dynamics. We derive general expressions for the chemical Langevin equation for a broad class of non-Markovian systems with distributed delay. Exemplars of a model of gene regulation with delayed autoinhibition and a model of epidemic spread with delayed recovery provide evidence of the applicability of our results.

Noisy voter models in switching environments.

We study the stationary states of variants of the noisy voter model, subject to fluctuating parameters or external environments. Specifically, we consider scenarios in which the herding-to-noise ratio switches randomly and on different timescales between two values. We show that this can lead to a phase in which polarized and heterogeneous states exist. Second, we analyze a population of noisy voters subject to groups of external influencers, and show how multipeak stationary distributions emerge. Our work is based on a combination of individual-based simulations, analytical approximations in terms of a piecewise-deterministic Markov processes (PDMP), and on corrections to this process capturing intrinsic stochasticity in the linear-noise approximation. We also propose a numerical scheme to obtain the stationary distribution of PDMPs with three environmental states and linear velocity fields.

Generalized Lotka-Volterra model with hierarchical interactions.

In the analysis of complex ecosystems it is common to use random interaction coefficients, which are often assumed to be such that all species are statistically equivalent. In this work we relax this assumption by imposing hierarchical interspecies interactions. These are incorporated into a generalized Lotka-Volterra dynamical system. In a hierarchical community species benefit more, on average, from interactions with species further below them in the hierarchy than from interactions with those above. Using dynamic mean-field theory, we demonstrate that a strong hierarchical structure is stabilizing, but that it reduces the number of species in the surviving community, as well as their abundances. Additionally, we show that increased heterogeneity in the variances of the interaction coefficients across positions in the hierarchy is destabilizing. We also comment on the structure of the surviving community and demonstrate that the abundance and probability of survival of a species are dependent on its position in the hierarchy.

Niche overlap and Hopfield-like interactions in generalized random Lotka-Volterra systems.

We study communities emerging from generalized random Lotka-Volterra dynamics with a large number of species with interactions determined by the degree of niche overlap. Each species is endowed with a number of traits, and competition between pairs of species increases with their similarity in trait space. This leads to a model with random Hopfield-like interactions. We use tools from the theory of disordered systems, notably dynamic mean-field theory, to characterize the statistics of the resulting communities at stable fixed points and determine analytically when stability breaks down. Two distinct types of transition are identified in this way, both marked by diverging abundances but differing in the behavior of the integrated response function. At fixed points only a fraction of the initial pool of species survives. We numerically study the eigenvalue spectra of the interaction matrix between extant species. We find evidence that the two types of dynamical transition are, respectively, associated with the bulk spectrum or an outlier eigenvalue crossing into the right half of the complex plane.

Lyapunov exponents for temporal networks.

By interpreting a temporal network as a trajectory of a latent graph dynamical system, we introduce the concept of dynamical instability of a temporal network and construct a measure to estimate the network maximum Lyapunov exponent (nMLE) of a temporal network trajectory. Extending conventional algorithmic methods from nonlinear time-series analysis to networks, we show how to quantify sensitive dependence on initial conditions and estimate the nMLE directly from a single network trajectory. We validate our method for a range of synthetic generative network models displaying low- and high-dimensional chaos and finally discuss potential applications.

Mixing times in evolutionary game dynamics.

Without mutation and migration, evolutionary dynamics ultimately leads to the extinction of all but one species. Such fixation processes are well understood and can be characterized analytically with methods from statistical physics. However, many biological arguments focus on stationary distributions in a mutation-selection equilibrium. Here, we address the mixing time required to reach stationarity in the presence of mutation. We show that mixing times in evolutionary games have the opposite behavior from fixation times when the intensity of selection increases: in coordination games with bistabilities, the fixation time decreases, but the mixing time increases. In coexistence games with metastable states, the fixation time increases, but the mixing time decreases. Our results are based on simulations and the Wentzel-Kramers-Brillouin approximation of the master equation.

The mechanics of stochastic slowdown in evolutionary games.

We study the stochastic dynamics of evolutionary games, and focus on the so-called 'stochastic slowdown' effect, previously observed in Altrock et al. (2010) for simple evolutionary dynamics. Slowdown here refers to the fact that a beneficial mutation may take longer to fixate than a neutral one. More precisely, the fixation time conditioned on the mutant taking over can show a maximum at intermediate selection strength. We show that this phenomenon is present in the Prisoner's Dilemma, and also discuss counterintuitive slowdown and speedup in coexistence games. In order to establish the microscopic origins of these phenomena, we calculate the average sojourn times. This allows us to identify the transient states which contribute most to the slowdown effect, and enables us to provide an understanding of slowdown in the takeover of a small group of cooperators by defectors in the Prisoner's Dilemma: Defection spreads fast initially, but the final steps to takeover can be delayed substantially. The analysis of coexistence games reveals even more intricate non-monotonic behavior. In small populations, the conditional average fixation time can show multiple extrema as a function of the selection strength, e.g., slowdown, speedup, and slowdown again. We classify generic 2×2 games with respect to the possibility to observe non-monotonic behavior of the conditional average fixation time as a function of selection strength.