种群和网络中随机多智能体动力学的Gillespie算法
Gillespie algorithms for stochastic multiagent dynamics in populations and network
摘要:
许多多智能体动态,包括网络上发生的各种集体动态,可以建模为一个随机过程,其中系统中的智能体在相互作用中随时间改变其状态。Gillespie算法是一种流行的算法,它精确地模拟了这种随机多智能体动态,当每个状态变化由离散事件驱动时,动态被定义在连续时间内,并且事件发生的随机规律由独立的泊松过程控制。在本卷的第一个主要部分中,我们提供了一个关于Gillespie算法的教程,重点是模拟人口和网络中发生的社会多智能体动态。我们不假设数学(或计算机科学或物理学)的高级知识。我们澄清了为什么在许多情况下应该使用连续时间模型和Gillespie算法,而不是使用离散时间模型。在本卷的其余部分,我们回顾了Gillespie算法的最新扩展,旨在为模型增加更多的真实性(即,非泊松情况)或加速模拟。
英文摘要:
Many multiagent dynamics, including various collective dynamics occurring on networks, can be modeled as a stochastic process in which the agents in the system change their state over time in interaction with each other. The Gillespie algorithms are popular algorithms that exactly simulate such stochastic multiagent dynamics when each state change is driven by a discrete event, the dynamics is defined in continuous time, and the stochastic law of event occurrence is governed by independent Poisson processes. In the first main part of this volume, we provide a tutorial on the Gillespie algorithms focusing on simulation of social multiagent dynamics occurring in populations and networks. We do not assume advanced knowledge of mathematics (or computer science or physics). We clarify why one should use the continuous-time models and the Gillespie algorithms in many cases, instead of easier-to-understand discrete-time models. In the remainder of this volume, we review recent extensions of the Gillespie algorithms aiming to add more reality to the model (i.e., non-Poissonian cases) or to speed up the simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。