Computing the complexity for Schelling segregation models

DOI10.1016/j.cnsns.2007.04.023zbMath1221.37185OpenAlexW2074222073MaRDI QIDQ718797

Carsten Schneider, Stefan Gerhold, Howard Weiss, Burkhard Zimmermann, L. Yu. Glebskiĭ

Publication date: 24 September 2011

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2007.04.023

zbMATH Keywords

entropycomplexitySchelling segregation modelagent based modellimit states

Mathematics Subject Classification ID

Dynamical systems in biology (37N25) Population dynamics (general) (92D25)

Related Items (4)

Scaling limits of the Schelling model ⋮ Topological Influence and Locality in Swap Schelling Games. ⋮ Convergence and hardness of strategic Schelling segregation ⋮ The impact of geometry on monochrome regions in the flip Schelling process

Uses Software

• gfun
• SIGMA
• GeneratingFunctions

Cites Work

• Unnamed Item
• The method of creative telescoping
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Dynamic models of segregation†
• Singularity Analysis of Generating Functions
• GFUN
• The dynamics of Schelling-type segregation models and a nonlinear graph Laplacian variational problem

This page was built for publication: Computing the complexity for Schelling segregation models