Search arXivSearch

arXiv · 1602.01501

Epidemics on networks with heterogeneous population and stochastic infection rates

Abstract

In this paper we study the diffusion of an SIS-type epidemics on a network under the presence of a random environment, that enters in the definition of the infection rates of the nodes. Accordingly, we model the infection rates in the form of independent stochastic processes. To analyze the problem, we apply a mean field approximation, which allows to get a stochastic differential equations for the probability of infection in each node, and classical tools about stability, which require to find suitable Lyapunov's functions. Here, we find conditions which guarantee, respectively, extinction and stochastic persistence of the epidemics. We show that there exists two regions, given in terms of the coefficients of the model, one where the system goes to extinction almost surely, and the other where it is stochastic permanent. These two regions are, unfortunately, not adjacent, as there is a gap between them, whose extension depends on the specific level of noise. In this last region, we perform numerical analysis to suggest the true behavior of the solution.

Explore related subjects

Keep this discovery

BibTeXRIS

Stefano Bonaccorsi, Stefania Ottaviano. 2016-02-03. Epidemics on networks with heterogeneous population and stochastic infection rates. https://doi.org/10.1016/j.mbs.2016.07.002

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