Computing the complexity for Schelling segregation models

Stefan Gerhold, Lev Glebsky, Carsten Schneider, Howard Weiss, Burkhard Zimmermann

Research output: Contribution to journalArticle

14 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)2236-2245
Number of pages10
JournalCommunications in Nonlinear Science and Numerical Simulation
Volume13
Issue number10
DOIs
StatePublished - Dec 1 2008

All Science Journal Classification (ASJC) codes

  • Numerical Analysis
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Computing the complexity for Schelling segregation models'. Together they form a unique fingerprint.

  • Cite this