Schelling Segregation Model
The Schelling segregation model is a classic agent-based model, demonstrating how even a mild preference for similar neighbors can lead to a much higher degree of segregation than we would intuitively expect. The model consists of agents on a square grid, where each grid cell can contain at most one agent. Agents come in two colors: red and blue. They are happy if a certain number of their eight possible neighbors are of the same color, and unhappy otherwise. Unhappy agents will pick a random empty cell to move to each step, until they are happy. The model keeps running until there are no unhappy agents.
By default, the number of similar neighbors the agents need to be happy is set to 3. That means the agents would be perfectly happy with a majority of their neighbors being of a different color (e.g. a Blue agent would be happy with five Red neighbors and three Blue ones). Despite this, the model consistently leads to a high degree of segregation, with most agents ending up with no neighbors of a different color.
To install the dependencies use pip and the requirements.txt in this directory. e.g.
$ pip install -r requirements.txt
How to Run
To run the model interactively, run
mesa runserver in this directory. e.g.
$ mesa runserver
Then open your browser to http://127.0.0.1:8521/ and press Reset, then Run.
To view and run some example model analyses, launch the IPython Notebook and open
analysis.ipynb. Visualizing the analysis also requires matplotlib.
run.py: Launches a model visualization server.
schelling.py: Contains the agent class, and the overall model class.
server.py: Defines classes for visualizing the model in the browser via Mesa's modular server, and instantiates a visualization server.
analysis.ipynb: Notebook demonstrating how to run experiments and parameter sweeps on the model.
Schelling's original paper describing the model:
An interactive, browser-based explanation and implementation:
Parable of the Polygons, by Vi Hart and Nicky Case.