Techniques to Understand Computer Simulations: Markov Chain Analysis
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.
Volume (Year): 12 (2009)
Issue (Month): 1 ()
|Contact details of provider:|| |
When requesting a correction, please mention this item's handle: RePEc:jas:jasssj:2008-19-2. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Flaminio Squazzoni)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.