Gillespie Algorithms for Stochastic Multiagent Dynamics in Populations and Networks
Part of Elements in the Structure and Dynamics of Complex Networks
- Authors:
- Naoki Masuda, State University of New York at Buffalo and Waseda University
- Christian L. Vestergaard, Institut Pasteur, CNRS, Paris
- Date Published: January 2023
- availability: Available
- format: Paperback
- isbn: 9781009239141
Paperback
Other available formats:
eBook
Looking for an inspection copy?
Please email [email protected] to enquire about an inspection copy of this book
-
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.
Read more- This title is also available as open access on Cambridge Core
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: January 2023
- format: Paperback
- isbn: 9781009239141
- length: 106 pages
- dimensions: 228 x 151 x 6 mm
- weight: 0.17kg
- availability: Available
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×