Computing the complexity for Schelling segregation models

DOI10.1016/J.CNSNS.2007.04.023zbMATH Open1221.37185OpenAlexW2074222073MaRDI QIDQ718797FDOQ718797

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

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

Recommendations

• Complexity of Ehrenfeucht models
• Revisiting separation: algorithms and complexity
• On the complexity of polyhedral separability
• Computation Models for Parameterized Complexity
• Estimation of the algorithmic complexity of classes of computable models
• scientific article
• The complexity of stratification computation
• Complexity of compartmental models
• Complexity estimates for the Schmüdgen Positivstellensatz
• scientific article; zbMATH DE number 5592483

zbMATH Keywords

entropycomplexityagent based modellimit statesSchelling segregation model

Mathematics Subject Classification ID

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

Cites Work

• GFUN
• Title not available (Why is that?)
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Singularity Analysis of Generating Functions
• Dynamic models of segregation†
• The method of creative telescoping
• The dynamics of Schelling-type segregation models and a nonlinear graph Laplacian variational problem

Cited In (5)

• Topological Influence and Locality in Swap Schelling Games.
• Convergence and hardness of strategic Schelling segregation
• From selfishness \& altruism to macro-behavior
• Scaling limits of the Schelling model
• The impact of geometry on monochrome regions in the flip Schelling process

Uses Software

• gfun
• SIGMA
• GeneratingFunctions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q718797)