Search arXivSearch

arXiv · 2005.00900

Markovian Switching of Mutation Rates in Evolutionary Network Dynamics

Abstract

The replicator-mutator dynamic was originally derived to model the evolution of language, and since the model was derived in such a general manner, it has been applied to the dynamics of social behavior and decision making in multi-agent networks. For the two type population, a bifurcation point of the mutation rate is derived, displaying different long-run behaviors above and below this point. The long-run behavior would naturally be subjected to noise from the environment, however, to date there does not exist a model that dynamically accounts for the effects of the environment. To account for the environmental impacts on the evolution of the populace, mutation rates above and below this bifurcation point are switched according to a continuous-time Markov chain. The long-run behaviors of this model are derived, showing a counterintuitive result that the majority of initial conditions will favor the dominated type.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew Vlasic. 2020-05-02. Markovian Switching of Mutation Rates in Evolutionary Network Dynamics. https://arxiv.org/abs/2005.00900

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR