An analysis of one-dimensional schelling segregation

Authors:
Christina Brandt;Nicole Immorlica;Gautam Kamath;Robert Kleinberg
Affiliations:
Stanford University, Stanford, CA, USA;Northwestern University, Evanston, IL, USA;Cornell University, Ithaca, NY, USA;Cornell University, Ithaca, NY, USA
Venue:
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Year:
2012

Citing 12
Cited 0

Probabilistic analysis of two heuristics for the 3-satisfiability problem

SIAM Journal on Computing
Analysis of two simple heuristics on a random instance of k-SAT

Journal of Algorithms
Emergence of the giant component in special Marcus-Lushnikov processes

Random Structures & Algorithms
Lower bounds for random 3-SAT via differential equations

Theoretical Computer Science - Phase transitions in combinatorial problems
Avoiding a giant component

Random Structures & Algorithms
The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Combinatorics, Probability and Computing
Random MAX SAT, random MAX CUT, and their phase transitions

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Sink Equilibria and Convergence

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Embracing the giant component

Random Structures & Algorithms
Maximum matching in sparse random graphs

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Birth control for giants

Combinatorica
Convergence to Equilibrium in Local Interaction Games

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so long as at least half his 2w nearest neighbors are of the same race as him. In the dynamics, randomly-chosen unhappy individuals successively swap locations. We consider the average size of monochromatic neighborhoods in the final stable state. Our analysis is the first rigorous analysis of the Schelling dynamics. We note that, in contrast to prior approximate analyses, the final state is nearly integrated: the average size of monochromatic neighborhoods is independent of n and polynomial in w.