This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Techniques to Understand Computer Simulations: Markov Chain Analysis

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Luis R. Izquierdo ()
Segismundo S. Izquierdo ()
José Manuel Galán ()
José Ignacio Santos ()

Additional information is available for the following registered author(s):

Abstract

The 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 Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://jasss.soc.surrey.ac.uk/12/1/6/6.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Article 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): ()
Pages:
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:jas:jasssj:2008-19-2

Contact details of provider:

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords: Computer Modelling; Simulation; Markov; Stochastic Processes; Analysis; Re-Implementation;

Statistics
Access and download statistics

Did you know? IDEAS is not the only service displaying RePEc data. Choose on RePEc which service fits your needs best.

This page was last updated on 2009-12-25.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.