Central limit theorems for SIR epidemics and percolation on configuration model random graphs
From MaRDI portal
Publication:2240877
DOI10.1214/20-AAP1642zbMath1475.92147arXiv1812.03105OpenAlexW3209044284WikidataQ113266289 ScholiaQ113266289MaRDI QIDQ2240877
Publication date: 4 November 2021
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03105
central limit theoremrandom graphSIR epidemicconfiguration modelsize of epidemicdensity dependent population processbond and site percolation
Epidemiology (92D30) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the epidemic curve
- Large graph limit for an SIR process in random network with heterogeneous connectivity
- Central limit approximations for Markov population processes with countably many types
- Mathematics of epidemics on networks. From exact to approximate models
- A note on a paper by Erik Volz: SIR dynamics in random networks
- On analytical approaches to epidemics on networks
- SIR dynamics in random networks with heterogeneous connectivity
- Analysis of a stochastic SIR epidemic on a random network incorporating household structure
- On percolation in random graphs with given vertex degrees
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Limit theorems for a random graph epidemic model
- Central limit theorems in the configuration model
- A stochastic SIR network epidemic model with preventive dropping of edges
- The asymptotic variance of the giant component of configuration model random graphs
- Network-based analysis of stochastic SIR epidemic models with random and proportionate mixing
- Network epidemic models with two levels of mixing
- Random Graphs and Complex Networks
- How Clustering Affects Epidemics in Random Networks
- Asymptotic equivalence and contiguity of some random graphs
- SIR epidemics on random graphs with a fixed degree sequence
- On a model for interference between searching insect parasites
- The Probability That a Random Multigraph is Simple
- Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
- A useful random time-scale transformation for the standard epidemic model
- On the convergence of supercritical general (C-M-J) branching processes
- A critical point for random graphs with a given degree sequence
- Chapter 1 Stochastic Epidemic Models
- Random graphs with given vertex degrees and switchings
- Asymptotic normality in random graphs with given vertex degrees
- The probability that a random multigraph is simple. II
- Law of large numbers for the SIR epidemic on a random graph with given degrees
- Acquaintance Vaccination in an Epidemic on a Random Graph with Specified Degree Distribution
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
- Solutions of ordinary differential equations as limits of pure jump markov processes
- Limit theorems for sequences of jump Markov processes approximating ordinary differential processes
This page was built for publication: Central limit theorems for SIR epidemics and percolation on configuration model random graphs