SearcharxivSearch

arXiv · 1609.05974

Phase transition for the SIR model with random transition rates on complete graphs

Abstract

In this paper we are concerned with the Susceptible-Infective-Removed model with random transition rates on complete graphs $C_n$ with $n$ vertices. We assign i. i. d. copies of a positive random variable $\xi$ on each vertex as the recovery rates and i. i. d copies of a positive random variable $\rho$ on each edge as the edge infection weights. We assume that a susceptible vertex is infected by an infective one at rate proportional to the edge weight on the edge connecting these two vertices while an infective vertex becomes removed with rate equals the recovery rate on it, then we show that the model performs the following phase transition when at $t=0$ one vertex is infective and others are susceptible. When $\lambda<\lambda_c$, the proportion of vertices which have ever been infective converges to $0$ weakly as $n\rightarrow+\infty$ while when $\lambda>\lambda_c$, there exist $c(\lambda)>0$ and $b(\lambda)>0$ such that for each $n\geq 1$ with probability at least $b(\lambda)$ the proportion of vertices which have ever been infective is at least $c(\lambda)$. Furthermore, we prove that $\lambda_c$ is the inverse of the production of the mean of $\rho$ and the mean of the inverse of $\xi$.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaofeng Xue. 2016-09-20. Phase transition for the SIR model with random transition rates on complete graphs. https://arxiv.org/abs/1609.05974

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