SearcharxivSearch

arXiv · 2308.00731

The contact process with an asymptomatic state

Abstract

In order to understand the cost of a potentially high infectiousness of symptomatic individuals or, on the contrary, the benefit of social distancing, quarantine, etc. in the course of an infectious disease, this paper considers a natural variant of the popular contact process that distinguishes between asymptomatic and symptomatic individuals. Infected individuals all recover at rate one but infect nearby individuals at a rate that depends on whether they show the symptoms of the disease or not. Newly infected individuals are always asymptomatic and may or may not show the symptoms before they recover. The analysis of the corresponding mean-field model reveals that, in the absence of local interactions, regardless of the rate at which asymptomatic individuals become symptomatic, there is an epidemic whenever at least one of the infection rates is sufficiently large. In contrast, our analysis of the interacting particle system shows that, when the rate at which asymptomatic individuals become symptomatic is small and the asymptomatic individuals are not infectious, there cannot be an epidemic even when the symptomatic individuals are highly infectious.

Explore related subjects

Keep this discovery

BibTeXRIS

Lamia Belhadji, Nicolas Lanchier, Max Mercer. 2023-08-01. The contact process with an asymptomatic state. https://arxiv.org/abs/2308.00731

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