scholarly journals Stochastic Simulation Algorithm for effective spreading dynamics on Time-evolving Adaptive NetworX (SSATAN-X)

2021 ◽  
Author(s):  
Nadezdha Malysheva ◽  
Max von Kleist

Modelling and simulating the dynamics of pathogen spreading has been proven crucial to inform public heath decisions, containment strategies, as well as cost-effectiveness calculations. Pathogen spreading is often modelled as a stochastic process that is driven by pathogen exposure on time-evolving contact networks. In adaptive networks, the spreading process depends not only on the dynamics of a contact network, but vice versa, infection dynamics may alter risk behaviour and thus feed back onto contact dynamics, leading to emergent complex dynamics. However, stochastic simulation of pathogen spreading processes on adaptive networks is currently computationally prohibitive. In this manuscript, we propose SSATAN-X, a new algorithm for the accurate stochastic simulation of pathogen spreading on adaptive networks. The key idea of SSATAN-X is to only capture the contact dynamics that are relevant to the spreading process. We show that SSATAN-X captures the contact dynamics and consequently the spreading dynamics accurately. The algorithm achieves a > 10 fold speed-up over the state-of-art stochastic simulation algorithm (SSA). The speed-up with SSATAN-X further increases when the contact dynamics are fast in relation to the spreading process, i.e. if contacts are short-lived and per-exposure infection risks are small, as applicable to most infectious diseases. We envision that SSATAN-X may extend the scope of analysis of pathogen spreading on adaptive networks. Moreover, it may serve to create benchmark data sets to validate novel numerical approaches for simulation, or for the data-driven analysis of the spreading dynamics on adaptive networks. A C++ implementation of the algorithm is available https://github.com/nmalysheva/SSATAN-X

2014 ◽  
Vol 15 (4) ◽  
pp. 1207-1236 ◽  
Author(s):  
Can Huang ◽  
Di Liu

AbstractIn this paper, we revisit the Nested Stochastic Simulation Algorithm (NSSA) for stochastic chemical reacting networks by first proving its strong convergence. We then study a speed up of the algorithm by using the explicit Tau-Leaping method as the Inner solver to approximate invariant measures of fast processes, for which strong error estimates can also be obtained. Numerical experiments are presented to demonstrate the validity of our analysis.


2018 ◽  
Vol 81 (8) ◽  
pp. 3074-3096 ◽  
Author(s):  
Jana Lipková ◽  
Georgios Arampatzis ◽  
Philippe Chatelain ◽  
Bjoern Menze ◽  
Petros Koumoutsakos

Sign in / Sign up

Export Citation Format

Share Document