کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
759565 896483 2008 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing the complexity for Schelling segregation models
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی مکانیک
پیش نمایش صفحه اول مقاله
Computing the complexity for Schelling segregation models
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Communications in Nonlinear Science and Numerical Simulation - Volume 13, Issue 10, December 2008, Pages 2236–2245
نویسندگان
, , , , ,