SearcharxivSearch

arXiv · 1109.0044

High host density favors greater virulence: a model of parasite-host dynamics based on multi-type branching processes

Abstract

We use a multitype continuous time Markov branching process model to describe the dynamics of the spread of parasites of two types that can mutate into each other in a common host population. Instead of using a single virulence characteristic which is typical of most mathematical models for infectious diseases, our model uses a combination of two characteristics: lethality and transmissibility. This makes the model capable of reproducing the empirically observed fact that the increase in the host density can lead to the prevalence of the more virulent pathogen type. We provide some numerical illustrations and discuss the effects of the size of the enclosure containing the host population on the encounter rate in our model that plays the key role in determining what pathogen type will eventually prevail. We also present a multistage extension of the model to situations where there are several populations and parasites can be transmitted from one of them to another.

Explore related subjects

Keep this discovery

BibTeXRIS

Konstantin Borovkov, Robert Day, Timothy Rice. 2011-08-31. High host density favors greater virulence: a model of parasite-host dynamics based on multi-type branching processes. https://arxiv.org/abs/1109.0044

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