SIR epidemics on random graphs with a fixed degree sequence

DOI10.1002/rsa.20401zbMath1401.92176OpenAlexW2082763638MaRDI QIDQ3165457

Tom Bohman, Michael E. Picollelli

Publication date: 26 October 2012

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

Full work available at URL: https://doi.org/10.1002/rsa.20401

zbMATH Keywords

random graphepidemicdynamic concentration

Mathematics Subject Classification ID

Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85)

Related Items

A functional central limit theorem for SI processes on configuration model graphs ⋮ The sharp threshold for making squares ⋮ Network-based analysis of a small Ebola outbreak ⋮ Heterogeneous network epidemics: real-time growth, variance and extinction of infection ⋮ Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ SIR dynamics with infection age in complex heterogeneous networks ⋮ 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 ⋮ 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 ⋮ A natural barrier in random greedy hypergraph matching ⋮ A note on the random greedy independent set algorithm ⋮ The front of the epidemic spread and first passage percolation ⋮ Law of large numbers for the SIR epidemic on a random graph with given degrees ⋮ Minimal contagious sets in random regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on a paper by Erik Volz: SIR dynamics in random networks
• Asymptotic normality of the \(k\)-core in random graphs
• SIR dynamics in random networks with heterogeneous connectivity
• On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
• The largest component in a subcritical random graph with a power law degree distribution
• Stochastic epidemic models: a survey
• Limit theorems for a random graph epidemic model
• Strong approximations for epidemic models
• Network epidemic models with two levels of mixing
• The implications of network structure for epidemic dynamics
• The scaling window for a random graph with a given degree sequence
• Karp–Sipser on Random Graphs with a Fixed Degree Sequence
• A simple solution to the k‐core problem
• The Probability That a Random Multigraph is Simple
• The threshold behaviour of epidemic models
• The duration of the closed stochastic epidemic
• 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
• Hamiltonicity of random graphs produced by 2‐processes
• 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