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...
Gespeichert in:
Beteilige Person: | |
---|---|
Weitere beteiligte Personen: | |
Format: | E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Cambridge
Cambridge University Press
2022
|
Schriftenreihe: | Cambridge elements. Elements in the structure and dynamics of complex networks
|
Links: | https://doi.org/10.1017/9781009239158 |
Zusammenfassung: | 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. |
Umfang: | 1 Online-Ressource (96 Seiten) |
ISBN: | 9781009239158 |
Internformat
MARC
LEADER | 00000nam a2200000 i 4500 | ||
---|---|---|---|
001 | ZDB-20-CTM-CR9781009239158 | ||
003 | UkCbUP | ||
005 | 20230110185713.0 | ||
006 | m|||||o||d|||||||| | ||
007 | cr|||||||||||| | ||
008 | 220103s2022||||enk o ||1 0|eng|d | ||
020 | |a 9781009239158 | ||
100 | 1 | |a Masuda, Naoki |d 1976- | |
245 | 1 | 0 | |a Gillespie algorithms for stochastic multiagent dynamics in populations and networks |c Naoki Masuda, Christian L. Vestergaard |
264 | 1 | |a Cambridge |b Cambridge University Press |c 2022 | |
300 | |a 1 Online-Ressource (96 Seiten) | ||
336 | |b txt | ||
337 | |b c | ||
338 | |b cr | ||
490 | 1 | |a Cambridge elements. Elements in the structure and dynamics of complex networks | |
520 | |a 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. | ||
700 | 1 | |a Vestergaard, Christian L. | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781009239141 |
966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781009239158 |3 Volltext |
912 | |a ZDB-20-CTM | ||
912 | |a ZDB-20-CTM | ||
049 | |a DE-91 |
Datensatz im Suchindex
DE-BY-TUM_katkey | ZDB-20-CTM-CR9781009239158 |
---|---|
_version_ | 1825574054802751489 |
adam_text | |
any_adam_object | |
author | Masuda, Naoki 1976- |
author2 | Vestergaard, Christian L. |
author2_role | |
author2_variant | c l v cl clv |
author_facet | Masuda, Naoki 1976- Vestergaard, Christian L. |
author_role | |
author_sort | Masuda, Naoki 1976- |
author_variant | n m nm |
building | Verbundindex |
bvnumber | localTUM |
collection | ZDB-20-CTM |
format | eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01923nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781009239158</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20230110185713.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">220103s2022||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781009239158</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Masuda, Naoki</subfield><subfield code="d">1976-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Gillespie algorithms for stochastic multiagent dynamics in populations and networks</subfield><subfield code="c">Naoki Masuda, Christian L. Vestergaard</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (96 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge elements. Elements in the structure and dynamics of complex networks</subfield><subfield code="x"></subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vestergaard, Christian L.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781009239141</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781009239158</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
id | ZDB-20-CTM-CR9781009239158 |
illustrated | Not Illustrated |
indexdate | 2025-03-03T11:58:08Z |
institution | BVB |
isbn | 9781009239158 |
language | English |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 1 Online-Ressource (96 Seiten) |
psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
publishDate | 2022 |
publishDateSearch | 2022 |
publishDateSort | 2022 |
publisher | Cambridge University Press |
record_format | marc |
series2 | Cambridge elements. Elements in the structure and dynamics of complex networks |
spelling | Masuda, Naoki 1976- Gillespie algorithms for stochastic multiagent dynamics in populations and networks Naoki Masuda, Christian L. Vestergaard Cambridge Cambridge University Press 2022 1 Online-Ressource (96 Seiten) txt c cr Cambridge elements. Elements in the structure and dynamics of complex 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 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. Vestergaard, Christian L. Erscheint auch als Druck-Ausgabe 9781009239141 |
spellingShingle | Masuda, Naoki 1976- Gillespie algorithms for stochastic multiagent dynamics in populations and networks |
title | Gillespie algorithms for stochastic multiagent dynamics in populations and networks |
title_auth | Gillespie algorithms for stochastic multiagent dynamics in populations and networks |
title_exact_search | Gillespie algorithms for stochastic multiagent dynamics in populations and networks |
title_full | Gillespie algorithms for stochastic multiagent dynamics in populations and networks Naoki Masuda, Christian L. Vestergaard |
title_fullStr | Gillespie algorithms for stochastic multiagent dynamics in populations and networks Naoki Masuda, Christian L. Vestergaard |
title_full_unstemmed | Gillespie algorithms for stochastic multiagent dynamics in populations and networks Naoki Masuda, Christian L. Vestergaard |
title_short | Gillespie algorithms for stochastic multiagent dynamics in populations and networks |
title_sort | gillespie algorithms for stochastic multiagent dynamics in populations and networks |
work_keys_str_mv | AT masudanaoki gillespiealgorithmsforstochasticmultiagentdynamicsinpopulationsandnetworks AT vestergaardchristianl gillespiealgorithmsforstochasticmultiagentdynamicsinpopulationsandnetworks |