时态Gillespie算法:时变网络上传染过程的快速模拟
Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
摘要:
随机模拟是分析复杂网络动态过程的基石之一,也是探索其行为的唯一途径。快速算法的发展是至关重要的,以允许大规模的模拟。Gillespie算法可用于快速模拟随机过程,其变体已被应用于模拟静态网络上的动态过程。然而,它的适应时间网络仍然是不平凡的。我们在这里提出了一个时间Gillespie算法,解决了这个问题。我们的方法是适用于一般泊松(恒定速率)过程的时间网络,随机精确,和多个数量级的速度比传统的模拟方案的基础上拒绝采样。我们还展示了如何可以扩展到模拟非马尔可夫过程。该算法是很容易适用于在实践中,作为一个例子,我们详细介绍了如何模拟泊松和非马尔可夫模型的流行病传播。也就是说,我们提供了伪代码及其在C++中的实现,用于模拟范例的易感-感染-易感和易感-感染-感染模型以及具有非恒定恢复率的易感-感染-感染模型。对于经验网络,时间Gillespie算法通常比拒绝采样快10到100倍。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。