SearcharxivSearch

arXiv · math/0603331

Individual versus cluster recoveries within a spatially structured population

Abstract

Stochastic modeling of disease dynamics has had a long tradition. Among the first epidemic models including a spatial structure in the form of local interactions is the contact process. In this article we investigate two extensions of the contact process describing the course of a single disease within a spatially structured human population distributed in social clusters. That is, each site of the $d$-dimensional integer lattice is occupied by a cluster of individuals; each individual can be healthy or infected. The evolution of the disease depends on three parameters, namely the outside infection rate which models the interactions between the clusters, the within infection rate which takes into account the repeated contacts between individuals in the same cluster, and the size of each social cluster. For the first model, we assume cluster recoveries, while individual recoveries are assumed for the second one. The aim is to investigate the existence of nontrivial stationary distributions for both processes depending on the value of each of the three parameters. Our results show that the probability of an epidemic strongly depends on the recovery mechanism.

Explore related subjects

Keep this discovery

BibTeXRIS

L. Belhadji, N. Lanchier. 2006-03-14. Individual versus cluster recoveries within a spatially structured population. https://doi.org/10.1214/105051605000000764

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