Title of article
Computing the complexity for Schelling segregation models
Author/Authors
Gerhold، نويسنده , , Stefan and Glebsky، نويسنده , , Lev and Schneider، نويسنده , , Carsten and Weiss، نويسنده , , Howard and Zimmermann، نويسنده , , Burkhard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
10
From page
2236
To page
2245
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.
Keywords
Schelling segregation model , Agent based model , Complexity , entropy , Limit states
Journal title
Communications in Nonlinear Science and Numerical Simulation
Serial Year
2008
Journal title
Communications in Nonlinear Science and Numerical Simulation
Record number
1533903
Link To Document