Gillespie algorithms for stochastic multiagent dynamics in populations and networks /
Masuda, Naoki, 1976-
Gillespie algorithms for stochastic multiagent dynamics in populations and networks / Naoki Masuda, Christian L. Vestergaard - Cambridge : Cambridge University Press, 2022 - online resource - Cambridge elements. Elements in the structure and dynamics of complex networks . - Cambridge elements. Elements in the structure and dynamics of complex networks .
Introduction -- Preliminaries -- Classic Gillespie Algorithms -- Computational Complexity and Efficient Implementations -- Gillespie Algorithms for Temporal Networks and Non-Poissonian Jump Processes
Available to OhioLINK libraries
Many multiagent dynamics 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. The first main part of this volume provides a tutorial on the Gillespie algorithms focusing on simulation of social multiagent dynamics occurring in populations and networks. The authors clarify why one should use the continuous-time models and the Gillespie algorithms in many cases, instead of easier-to-understand discrete-time models. The remainder of the Element reviews 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. This title is also available as open access on Cambridge Core
9781009239158
ALGORITHMS
STOCHASTIC PROCESSES
MULTIAGENT SYSTEMS
SYSTEM ANALYSIS
QA 9.58 / M37G 2022
Gillespie algorithms for stochastic multiagent dynamics in populations and networks / Naoki Masuda, Christian L. Vestergaard - Cambridge : Cambridge University Press, 2022 - online resource - Cambridge elements. Elements in the structure and dynamics of complex networks . - Cambridge elements. Elements in the structure and dynamics of complex networks .
Introduction -- Preliminaries -- Classic Gillespie Algorithms -- Computational Complexity and Efficient Implementations -- Gillespie Algorithms for Temporal Networks and Non-Poissonian Jump Processes
Available to OhioLINK libraries
Many multiagent dynamics 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. The first main part of this volume provides a tutorial on the Gillespie algorithms focusing on simulation of social multiagent dynamics occurring in populations and networks. The authors clarify why one should use the continuous-time models and the Gillespie algorithms in many cases, instead of easier-to-understand discrete-time models. The remainder of the Element reviews 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. This title is also available as open access on Cambridge Core
9781009239158
ALGORITHMS
STOCHASTIC PROCESSES
MULTIAGENT SYSTEMS
SYSTEM ANALYSIS
QA 9.58 / M37G 2022