SearcharxivSearch

arXiv · 2404.12566

The SIR epidemic on a dynamic Erd\H{o}s-R\'enyi random graph

Abstract

We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large numbers for the susceptible, infected, and recovered ratio curves after a random time shift, and demonstrate that, under a variety of possible scaling limits of the model parameters, the epidemic curves are solutions to a system of ordinary differential equations. In most scaling regimes, these equations coincide with the classical SIR epidemic equations. In the regime where the average degree of the network remains constant and the edge-flipping dynamics remain on the same time scale as the infectious contact process, however, a novel set of differential equations emerges. This system contains additional quantities related to the infectious edges, but somewhat surprisingly, contains no quantities related to higher-order local network configurations. To the best of our knowledge, this study represents the first thorough and rigorous analysis of large population epidemic processes on dynamic random graphs, although our findings are contingent upon conditioning on a (possibly strict) subset of the event of an epidemic outbreak.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuanfei Huang, Adrian Röllin. 2024-04-19. The SIR epidemic on a dynamic Erd\H{o}s-R\'enyi random graph. https://arxiv.org/abs/2404.12566

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