Gillespie algorithms for stochastic multiagent dynamics in populations and networks

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Naoki Masuda, Christian L Vestergaard

Ngôn ngữ: eng

ISBN: 9781009239158 (ebook)

Ký hiệu phân loại: 518.1 Algorithms formerly 511.81

Thông tin xuất bản: Cambridge : Cambridge University Press, 2022.

Mô tả vật lý: 1 online resource (96 pages) : , digital, PDF file(s).

Bộ sưu tập: Tài liệu truy cập mở

ID: 371963

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.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 71010608 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH