Gillespie algorithms for stochastic multiagent dynamics in populations and networks
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...
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | Inglés |
| Published: |
Cambridge :
Cambridge University Press
2022.
|
| Edition: | First edition |
| Series: | Cambridge elements. Elements in the structure and dynamics of complex networks,
|
| Subjects: | |
| See on Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009769405906719 |
Table of Contents:
- 1. Introduction; 2. Preliminaries; 3. Classic Gillespie Algorithms; 4. Computational Complexity and Efficient Implementations; 5. Gillespie Algorithms for Temporal Networks and Non-Poissonian Jump Processes; 6. Conclusions; References.
