SIR epidemics on random graphs with a fixed degree sequence

DOI10.1002/RSA.20401MaRDI QIDQ3165457zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Law of large numbers for the SIR epidemic on a random graph with given degrees
• Large graph limit for an SIR process in random network with heterogeneous connectivity
• SIR epidemics on a Bernoulli random graph
• Near-critical SIR epidemic on a random graph with given degrees
• SIR dynamics in random networks with heterogeneous connectivity

Cites work

• scientific article; zbMATH DE number 3583044 (Why is no real title available?)
• scientific article; zbMATH DE number 1471878 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• A note on a paper by Erik Volz: SIR dynamics in random networks
• A simple solution to the k‐core problem
• Asymptotic normality of the \(k\)-core in random graphs
• Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
• Hamiltonicity of random graphs produced by 2‐processes
• Karp-Sipser on random graphs with a fixed degree sequence
• Limit theorems for a random graph epidemic model
• Network epidemic models with two levels of mixing
• On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
• On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
• SIR dynamics in random networks with heterogeneous connectivity
• SIR epidemics on a Bernoulli random graph
• Stochastic epidemic models: a survey
• Strong approximations for epidemic models
• The Critical Phase for Random Graphs with a Given Degree Sequence
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The diameter of sparse random graphs
• The duration of the closed stochastic epidemic
• The implications of network structure for epidemic dynamics
• The largest component in a subcritical random graph with a power law degree distribution
• The probability that a random multigraph is simple
• The scaling window for a random graph with a given degree sequence
• The threshold behaviour of epidemic models

Cited in

(50)

• A note on the Markovian SIR epidemic on a random graph with given degrees
• Generalised probability mass function for the final epidemic size of an \textit{SIR} model on a line of triangles network
• Heterogeneous network epidemics: real-time growth, variance and extinction of infection
• A stochastic SIR network epidemic model with preventive dropping of edges
• A covering-graph approach to epidemics on SIS and SIS-like networks
• On the expected total number of infections for virus spread on a finite network
• SIR epidemics on a Bernoulli random graph
• On analytical approaches to epidemics on networks
• SIR dynamics in random networks with heterogeneous connectivity
• The front of the epidemic spread and first passage percolation
• The epidemic model based on the approximation for third-order motifs on networks
• Central limit theorems for SIR epidemics and percolation on configuration model random graphs
• Distribution dynamics for SIS model on random networks
• The large graph limit of a stochastic epidemic model on a dynamic multilayer network
• Analysis of the survival time of the SIRS process via expansion
• The duration of a supercritical \(\mathit{SIR}\) epidemic on a configuration model
• Network-based analysis of a small Ebola outbreak
• The sharp threshold for making squares
• Near-critical SIR epidemic on a random graph with given degrees
• Multivariate generating functions for information spread on multi-type random graphs
• Generating function approach to the effective degree SIR model
• On the spread of viruses on the Internet
• Finding the probability of infection in an SIR network is NP-hard
• Dynamics of epidemic spreading on connected graphs
• Law of large numbers for the SIR model with random vertex weights on Erdős-Rényi graph
• Susceptible-infected epidemics on evolving graphs
• Embedding theorems for random graphs with specified degrees
• A note on a paper by Erik Volz: SIR dynamics in random networks
• Viral processes by random walks on random regular graphs
• Edge deletion algorithms for minimizing spread in SIR epidemic models
• Large graph limit for an SIR process in random network with heterogeneous connectivity
• Law of large numbers for the SIR epidemic on a random graph with given degrees
• Spreading properties for SIR models on homogeneous trees
• Mixed SI (R) epidemic dynamics in random graphs with general degree distributions
• Behaviour of the minimum degree throughout the d-process
• Epidemics on critical random graphs with heavy-tailed degree distribution
• FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model
• The end time of SIS epidemics driven by random walks on edge-transitive graphs
• The triangle-free process and the Ramsey number \(R(3,k)\)
• A functional central limit theorem for SI processes on configuration model graphs
• Switchover phenomenon for general graphs
• Minimal contagious sets in random regular graphs
• A natural barrier in random greedy hypergraph matching
• SIR dynamics with infection age in complex heterogeneous networks
• High degree vertices and spread of infections in spatially modelled social networks
• The extinction time of a subcritical branching process related to the SIR epidemic on a random graph
• A note on the random greedy independent set algorithm
• Local asymptotic properties of complex networks and their applications to infectious diseases
• Stochastic processes on random graphs with multiple type edges
• Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks

This page was built for publication: SIR epidemics on random graphs with a fixed degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165457)