Evidence map›Paper›PMID 26517860›Full record

ArticlePLoS computational biology2015

Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks.

Christian L Vestergaard, Mathieu Génois

Erratum issuedAbstract read
In one paragraph

Article in PLoS computational biology, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. An erratum has been issued. Cited by 35 papers.

0numbers the graph read from it
0cells of the map it votes in
35citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

35 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

2 authors.

Christian L VestergaardAix Marseille Université, Université de Toulon, CNRS, CPT, UMR 7332, Marseille, France.
Mathieu GénoisAix Marseille Université, Université de Toulon, CNRS, CPT, UMR 7332, Marseille, France.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling.

Indexed as

AlgorithmsModels, StatisticalComputer SimulationContact TracingDisease Transmission, InfectiousEpidemicsHumansRisk AssessmentSpatio-Temporal AnalysisStochastic Processes

Identifiers

PMID26517860
PMCPMC4627738

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.