MARKOV CHAIN AGGREGATION FOR SIMPLE AGENT-BASED MODELS ON SYMMETRIC NETWORKS: THE VOTER MODEL
Open Access
- 1 May 2015
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Advances in Complex Systems
- Vol. 18 (03n04) , 1550011
Abstract
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.Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Aggregation in agent-based models of economiesThe Knowledge Engineering Review, 2012
- Genetic demixing and evolution in linear stepping stone modelsReviews of Modern Physics, 2010
- Analytical solution of the voter model on uncorrelated networksNew Journal of Physics, 2008
- Analytical results for the Sznajd model of opinion formationThe European Physical Journal B, 2003
- Exact results for kinetics of catalytic reactionsPhysical Review E, 1996
- Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$The Annals of Probability, 1989
- Markov FunctionsThe Annals of Probability, 1981
- A model for spatial conflictBiometrika, 1973
- A Markovian Function of a Markov ChainThe Annals of Mathematical Statistics, 1958
- Random processes in geneticsMathematical Proceedings of the Cambridge Philosophical Society, 1958