pith. sign in

arxiv: 1812.10845 · v2 · pith:NFCKPUZSnew · submitted 2018-12-27 · 💻 cs.SI · physics.soc-ph

Rejection-Based Simulation of Stochastic Spreading Processes on Complex Networks

classification 💻 cs.SI physics.soc-ph
keywords stochasticnetworksprocessessimulationspreadingmodelabsoluteaccording
0
0 comments X
read the original abstract

Stochastic processes can model many emerging phenomena on networks, like the spread of computer viruses, rumors, or infectious diseases. Understanding the dynamics of such stochastic spreading processes is therefore of fundamental interest. In this work we consider the wide-spread compartment model where each node is in one of several states (or compartments). Nodes change their state randomly after an exponentially distributed waiting time and according to a given set of rules. For networks of realistic size, even the generation of only a single stochastic trajectory of a spreading process is computationally very expensive. Here, we propose a novel simulation approach, which combines the advantages of event-based simulation and rejection sampling. Our method outperforms state-of-the-art methods in terms of absolute run-time and scales significantly better, while being statistically equivalent.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Reducing Spreading Processes on Networks to Markov Population Models

    cs.SI 2019-06 unverdicted novelty 6.0

    A novel node-partitioning lumping scheme reduces arbitrary epidemic models on networks to approximate Markov Population Models with smaller state spaces.