Techniques to Understand Computer Simulations: Markov Chain Analysis
AbstractThe aim of this paper is to assist researchers in understanding the dynamics of simulation models that have been implemented and can be run in a computer, i.e. computer models. To do that, we start by explaining (a) that computer models are just input-output functions, (b) that every computer model can be re-implemented in many different formalisms (in particular in most programming languages), leading to alternative representations of the same input-output relation, and (c) that many computer models in the social simulation literature can be usefully represented as time-homogeneous Markov chains. Then we argue that analysing a computer model as a Markov chain can make apparent many features of the model that were not so evident before conducting such analysis. To prove this point, we present the main concepts needed to conduct a formal analysis of any time-homogeneous Markov chain, and we illustrate the usefulness of these concepts by analysing 10 well-known models in the social simulation literature as Markov chains. These models are: â€¢ Schelling\'s (1971) model of spatial segregation â€¢ Epstein and Axtell\'s (1996) Sugarscape â€¢ Miller and Page\'s (2004) standing ovation model â€¢ Arthur\'s (1989) model of competing technologies â€¢ Axelrod\'s (1986) metanorms models â€¢ Takahashi\'s (2000) model of generalized exchange â€¢ Axelrod\'s (1997) model of dissemination of culture â€¢ Kinnaird\'s (1946) truels â€¢ Axelrod and Bennett\'s (1993) model of competing bimodal coalitions â€¢ Joyce et al.\'s (2006) model of conditional association In particular, we explain how to characterise the transient and the asymptotic dynamics of these computer models and, where appropriate, how to assess the stochastic stability of their absorbing states. In all cases, the analysis conducted using the theory of Markov chains has yielded useful insights about the dynamics of the computer model under study.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Journal of Artificial Societies and Social Simulation in its journal Journal of Artificial Societies and Social Simulation.
Volume (Year): 12 (2009)
Issue (Month): 1 ()
Contact details of provider:
Computer Modelling; Simulation; Markov; Stochastic Processes; Analysis; Re-Implementation;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Sven Banischa & Ricardo Lima & Tanya Araújo, 2012. "Agent based models and opinion dynamics as markov chains," Working Papers 2012/10, Department of Economics at the School of Economics and Management (ISEG), Technical University of Lisbon..
- Pfau, Jens & Kirley, Michael & Kashima, Yoshihisa, 2013. "The co-evolution of cultures, social network communities, and agent locations in an extension of Axelrod’s model of cultural dissemination," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(2), pages 381-391.
- Jakob Grazzini & Matteo G. Richiardi, 2013. "Consistent Estimation of Agent-Based Models by Simulated Minimum Distance," LABORatorio R. Revelli Working Papers Series 130, LABORatorio R. Revelli, Centre for Employment Studies.
- Edoardo Gaffeo & Mauro Gallegati & Umberto Gostoli, 2012. "An agent-based "proof of principle" for Walrasian macroeconomic theory," CEEL Working Papers 1202, Cognitive and Experimental Economics Laboratory, Department of Economics, University of Trento, Italia.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nigel Gilbert).
If references are entirely missing, you can add them using this form.