.png){kind=icon}
.png){kind=icon}
Return
Computing the complexity for Schelling segregation models
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cnsns.2007.04.023.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
Schelling segregation model
agent based model
complexity
limit states
entropy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
9.2K
Citations:
1.8W
View more organizations