Law of large numbers for the SIR epidemic on a random graph with given degrees

DOI10.1002/rsa.20575zbMath1328.05170arXiv1308.5493OpenAlexW2118450678WikidataQ115150371 ScholiaQ115150371MaRDI QIDQ5256391

Svante Janson, Peter Windridge, Malwina J. Luczak

Publication date: 22 June 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5493

zbMATH Keywords

configuration modelrandom graph with given degree sequenceSIR epidemic process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (31)

Not all interventions are equal for the height of the second peak ⋮ Epidemic spreading and equilibrium social distancing in heterogeneous networks ⋮ SIR dynamics with vaccination in a large configuration model ⋮ Fluctuations for the outbreak prevalence of the SIR epidemics in complex networks ⋮ A functional central limit theorem for SI processes on configuration model graphs ⋮ Law of large numbers for the SIR model with random vertex weights on Erdős-Rényi graph ⋮ Mean Field at Distance One ⋮ Network-based analysis of a small Ebola outbreak ⋮ Pairwise approximation for SIR -type network epidemics with non-Markovian recovery ⋮ Heterogeneous network epidemics: real-time growth, variance and extinction of infection ⋮ SIR epidemics and vaccination on random graphs with clustering ⋮ Epidemics on networks with preventive rewiring ⋮ Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks ⋮ Contagion risks and security investment in directed networks ⋮ Asymptotic normality in random graphs with given vertex degrees ⋮ Unnamed Item ⋮ Chain-referral sampling on stochastic block models ⋮ The large graph limit of a stochastic epidemic model on a dynamic multilayer network ⋮ A stochastic SIR network epidemic model with preventive dropping of edges ⋮ Central limit theorems for SIR epidemics and percolation on configuration model random graphs ⋮ Dangerous connections: on binding site models of infectious disease dynamics ⋮ The duration of a supercritical \(\mathit{SIR}\) epidemic on a configuration model ⋮ The epidemic model based on the approximation for third-order motifs on networks ⋮ Near-critical SIR epidemic on a random graph with given degrees ⋮ The extinction time of a subcritical branching process related to the SIR epidemic on a random graph ⋮ Epidemic threshold in pairwise models for clustered networks: closures and fast correlations ⋮ Susceptible-infected epidemics on evolving graphs ⋮ The front of the epidemic spread and first passage percolation ⋮ The probability that a random multigraph is simple. II ⋮ Limit laws for self-loops and multiple edges in the configuration model ⋮ Minimal contagious sets in random regular graphs

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the epidemic curve
• Large graph limit for an SIR process in random network with heterogeneous connectivity
• A note on a paper by Erik Volz: SIR dynamics in random networks
• On the robustness of random \(k\)-cores
• Asymptotic normality of the \(k\)-core in random graphs
• SIR dynamics in random networks with heterogeneous connectivity
• Contact processes on random graphs with power law degree distributions have critical value 0
• Analysis of a stochastic SIR epidemic on a random network incorporating household structure
• Differential equation approximations for Markov chains
• Limit theorems for a random graph epidemic model
• Logarithmic combinatorial structures: A probabilistic approach
• Network epidemic models with two levels of mixing
• Karp–Sipser on Random Graphs with a Fixed Degree Sequence
• SIR epidemics on random graphs with a fixed degree sequence
• A simple solution to the k‐core problem
• Epidemics on Random Graphs with Tunable Clustering
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• SIR epidemics on a Bernoulli random graph
• A critical point for random graphs with a given degree sequence
• The diameter of sparse random graphs
• Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
• On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
• The Critical Phase for Random Graphs with a Given Degree Sequence

This page was built for publication: Law of large numbers for the SIR epidemic on a random graph with given degrees