Computing the complexity for Schelling segregation models
Article
-
- Overview
-
- Research
-
- Identity
-
- Additional Document Info
-
- View All
-
Overview
abstract
-
The Schelling segregation models are agent based population models, where individual members of the population (agents) interact directly with other agents and move in space and time. In this note we study one-dimensional Schelling population models as finite dynamical systems. We define a natural notion of entropy which measures the complexity of the family of these dynamical systems. The entropy counts the asymptotic growth rate of the number of limit states. We find formulas and deduce precise asymptotics for the number of limit states, which enable us to explicitly compute the entropy. © 2007 Elsevier B.V. All rights reserved.
publication date
published in
Research
keywords
-
Agent based model; Complexity; Entropy; Limit states; Schelling segregation model Asymptotic stability; Dynamical systems; Entropy; Growth rate; Mathematical models; Segregation (metallography); Agent based model; Schelling segregation model; Agents; Agents; Asymptotic stability; Dynamical systems; Entropy; Growth rate; Mathematical models; Segregation (metallography)
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue