The probabilistic structure of discrete agent-based models

DOI10.5890/DNC.2014.09.005MaRDI QIDQ2939052zbMATH OpenFDO

Authors Sven Banisch

Publication date 16 January 2015

Published in The interdisciplinary journal of Discontinuity, Complexity, and Nonlinearity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.6277

zbMATH Keywords

agent-based modelsaggregationgraph symmetriesMarkov chainsrandom walks

Mathematics Subject Classification ID

Random walks on graphs (05C81) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Agent technology and artificial intelligence (68T42)

Abstract: This paper describes a formalization of agent-based models (ABMs) as random walks on regular graphs and relates the symmetry group of those graphs to a coarse-graining of the ABM that is still Markovian. An ABM in which $N$ agents can be in $delta$ different states leads to a Markov chain with $delt{a}^N$ states. In ABMs with a sequential update scheme by which one agent is chosen to update its state at a time, transitions are only allowed between system configurations that differ with respect to a single agent. This characterizes ABMs as random walks on regular graphs. The non-trivial automorphisms of those graphs make visible the dynamical symmetries that an ABM gives rise to because sets of micro configurations can be interchanged without changing the probability structure of the random walk. This allows for a systematic loss-less reduction of the state space of the model.

Recommendations

• Approximate lumpability for Markovian agent-based models using local symmetries
• Markov chain aggregation for agent-based models
• Agent-based modeling, mathematical formalism for
• Agent-based modeling: population limits and large timescales
• Statistical agent-based models for discrete spatio-temporal systems

Cited in

(8)

• A self-referential agent-based model that consists of a large number of agents moving stochastically in a discrete bounded domain.
• On the probabilistic approach to heterogeneous structure interactions in agent-based computational models
• Translating Discrete Multi-Agents Systems into Cellular Automata: Application to Diffusion-Limited Aggregation
• Opinion polarization by learning from social feedback
• Global density analysis for an off-lattice agent-based model
• Approximate lumpability for Markovian agent-based models using local symmetries
• Structure-generating mechanisms in agent-based models
• Markov chain aggregation for agent-based models

This page was built for publication: The probabilistic structure of discrete agent-based models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939052)