A functional central limit theorem for SI processes on configuration model graphs
From MaRDI portal
Publication:5055332
DOI10.1017/apr.2022.52zbMath1503.60041OpenAlexW4294692208WikidataQ114119632 ScholiaQ114119632MaRDI QIDQ5055332
Casper Woroszylo, Heinz Koeppl, Wasiur R. KhudaBukhsh, Grzegorz A. Rempała
Publication date: 13 December 2022
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/apr.2022.52
Epidemiology (92D30) Central limit and other weak theorems (60F05) Functional limit theorems; invariance principles (60F17)
Related Items (3)
Towards inferring network properties from epidemic data ⋮ Central limit theorems in the configuration model ⋮ A stochastic SIR network epidemic model with preventive dropping of edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Diffusion and cascading behavior in random networks
- A note on a paper by Erik Volz: SIR dynamics in random networks
- Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
- SIR dynamics in random networks with heterogeneous connectivity
- Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction
- Contact processes on random graphs with power law degree distributions have critical value 0
- Limit theorems for a random graph epidemic model
- Central limit theorems in the configuration model
- A general model for stochastic SIR epidemics with two levels of mixing
- First passage percolation on random graphs with finite mean degrees
- Dynamics of stochastic epidemics on heterogeneous networks
- A decomposition theorem for supermartingales
- Universality for first passage percolation on sparse random graphs
- Random Graphs and Complex Networks
- Emergence of Scaling in Random Networks
- First Passage Percolation on the Erdős–Rényi Random Graph
- SIR epidemics on random graphs with a fixed degree sequence
- The large graph limit of a stochastic epidemic model on a dynamic multilayer network
- Percolation
- Dynamical Processes on Complex Networks
- A new approach to the giant component problem
- Central limit theorems for local martingales
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
- Law of large numbers for the SIR epidemic on a random graph with given degrees
- On the Limit Behaviour of Extreme Order Statistics
- Probability
- Statistical models based on counting processes
This page was built for publication: A functional central limit theorem for SI processes on configuration model graphs