Gillespie algorithms for stochastic multiagent dynamics in populations and network
arXiv:2112.05293 · doi:10.1017/9781009239158
Abstract
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.
arXiv comment25 figures. Elements in the Structure and Dynamics of Complex Networks. Cambridge: Cambridge University Press (2023)
References in corpus (38)
- Epidemic spreading in scale-free networks
- Statistical physics of social dynamics
- Epidemic processes in complex networks
- Temporal Networks
- Prediction and predictability of global epidemics: the role of the airline transportation network
- Forecast and Control of Epidemics in a Globalized World
- Reaction-diffusion processes and metapopulation models in heterogeneous networks
- Adaptive Coevolutionary Networks: A Review
- Small But Slow World: How Network Topology and Burstiness Slow Down Spreading
- Modern temporal network theory: A colloquium
- Evolutionary Games and Computer Simulations
- A modified Next Reaction Method for simulating chemical systems with time dependent propensities and delays
- The dynamical strength of social ties in information spreading
- Close encounters in a pediatric ward: measuring face-to-face proximity and mixing patterns with wearable sensors
- Fundamentals of spreading processes in single and multilayer complex networks
- Random graph models for dynamic networks
- Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
- Simulating non-Markovian stochastic processes
- Non-perturbative heterogeneous mean-field approach to epidemic spreading in complex networks
- Markovian Dynamics on Complex Reaction Networks
- The limitations of discrete-time approaches to continuous-time contagion dynamics
- Extinction in neutrally stable stochastic Lotka-Volterra models
- The dynamics of critical Kauffman networks under asynchronous stochastic update
- Stability of Spreading Processes over Time-Varying Large-Scale Networks
- A Gillespie algorithm for non-Markovian stochastic processes
- Scaling in the Inter-Event Time of Random and Seasonal Systems
- Multiscale Analysis of Spreading in a Large Communication Network
- Extinction in Lotka-Volterra model
- Optimized Gillespie algorithms for the simulation of Markovian epidemic processes on large and heterogeneous networks
- Multilayer Network Science: from Cells to Societies
- Reconstructing networks
- Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm
- Fast and principled simulations of the SIR model on temporal networks
- Two-state Markov-chain Poisson nature of individual cellphone call statistics
- Gillespie algorithms for stochastic multiagent dynamics in populations and network
- Small inter-event times govern epidemic spreading on temporal networks
- Long-tailed distributions of inter-event times as mixtures of exponential distributions
- Generative models of simultaneously heavy-tailed distributions of inter-event times on nodes and edges
Cited by in corpus (8)
- Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
- Gillespie algorithms for stochastic multiagent dynamics in populations and network
- A Parrondo paradox in susceptible-infectious-susceptible dynamics over periodic temporal networks
- A unified perspective on exponential tilt and bridge algorithms for rare trajectories of discrete Markov processes
- Biased versus unbiased numerical methods for stochastic simulations
- Spline tie-decay temporal networks
- Effects of concurrency on epidemic spreading in Markovian temporal networks
- Target-density formation in swarms with stochastic sensing and dynamics