SearcharxivSearch

arXiv · 2603.03009

Susceptible-Infected Epidemics on Evolving Graphs at Critical Infection Rate

Abstract

Consider an SI process on a graph $G$ where each S--I connection becomes I--I at rate $\lambda$. Here S and I stand for ``susceptible'' and ``infected'' respectively. The evoSI model is a modification of the SI model in which S--I edges are broken at rate $\rho$ and the ``S'' connects to a randomly chosen vertex. It is proven in Durrett and Yao [2022, Electron. J. Probab.] that, for the supercritical evoSI process on the configuration model, there exists a quantity $\Delta$ depending on the first three moments of the degree distribution such that the sign of $\Delta$ governs the continuity of the phase transition of the final epidemic size near the critical infection rate $\lambda_c$. In this paper, we consider the critical evoSI model on the configuration model, i.e., $\lambda=\lambda_c$. We show that, if $\Delta>0$, then the probability of a major outbreak starting from a single infected individual is $Cn^{-1/3}(1+o(1))$ for some explicit constant $C>0$, where $n$ is the size of the graph. On the contrary, if $\Delta<0$, then this probability is $o(n^{-1/3})$. The case $\Delta<0$ is reminiscent of the critical {\ER} graphs, where the probability for the size of the largest component to be of order $n$ decays exponentially in $n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenze Chen, Haojie Hou, Ruibo Ma, Dong Yao. 2026-03-03. Susceptible-Infected Epidemics on Evolving Graphs at Critical Infection Rate. https://arxiv.org/abs/2603.03009

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