MARKOV CHAIN AGGREGATION FOR SIMPLE AGENT-BASED MODELS ON SYMMETRIC NETWORKS: THE VOTER MODEL
Advances in Complex Systems · 2015-05 · 18 (03n04) · 1550011
DOI: 10.1142/s0219525915500113 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Complex Systems, online erschienen am 15.09.2015. Verfasst von SVEN BANISCH und 1 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 39 Literaturangaben.
Abstract (Originalsprache)
For Agent-based models, in particular the Voter Model (VM), a general framework of aggregation is developed which exploits the symmetries of the agent network G. Depending on the symmetry group Aut ω (N) of the weighted agent network, certain ensembles of agent configurations can be interchanged without affecting the dynamical properties of the VM. These configurations can be aggregated into the same macro state and the dynamical process projected onto these states is, contrary to the general case, still a Markov chain. The method facilitates the analysis of the relation between microscopic processes and a their aggregation to a macroscopic level of description and informs about the complexity of a system introduced by heterogeneous interaction relations. In some cases the macro chain is solvable.
Zitieren
APA
BANISCH, S., & LIMA, R. (2015). MARKOV CHAIN AGGREGATION FOR SIMPLE AGENT-BASED MODELS ON SYMMETRIC NETWORKS: THE VOTER MODEL. Advances in Complex Systems, 18(03n04), 1550011. https://doi.org/10.1142/s0219525915500113
Vancouver
BANISCH S, LIMA R. MARKOV CHAIN AGGREGATION FOR SIMPLE AGENT-BASED MODELS ON SYMMETRIC NETWORKS: THE VOTER MODEL. Advances in Complex Systems. 2015;18(03n04):1550011. doi:10.1142/s0219525915500113
BibTeX
@article{BANISCH2015,
author = {BANISCH, SVEN and LIMA, RICARDO},
title = {MARKOV CHAIN AGGREGATION FOR SIMPLE AGENT-BASED MODELS ON SYMMETRIC NETWORKS: THE VOTER MODEL},
journal = {Advances in Complex Systems},
year = {2015},
volume = {18},
number = {03n04},
pages = {1550011},
doi = {10.1142/s0219525915500113}
}
EUVIMED