activity
20132018
most citedUnperturbed Schelling segregation in two or three dimensions

20 citations · 23 across the 4 of their papers we have counts for

collaborators

7 papers

math.CO2018

Evolving Shelah-Spencer Graphs

Richard Elwes

An \emph{evolving Shelah-Spencer process} is one by which a random graph grows, with at each time a new node incorporated and attached to each previous node with pro…

math.CO2016★ 2 cited

A Preferential Attachment Process Approaching the Rado Graph

Richard Elwes

We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new st vertex is added at each subsequent time step , and con…

cs.DM2015

Minority population in the one-dimensional Schelling model of segregation

George Barmpalias, Richard Elwes, Andy Lewis-Pye

The Schelling model of segregation looks to explain the way in which a population of agents or particles of two types may come to organise itself into large homogeneous clusters, a…

cs.MA2015★ 20 cited

Unperturbed Schelling segregation in two or three dimensions

George Barmpalias, Richard Elwes, Andy Lewis-Pye

Schelling's model of segregation, first described in 1969, has become one of the best known models of self-organising behaviour. While Schelling's explicit concern was to understan…

math.CO2015

Preferential Attachment Processes Approaching The Rado Multigraph

Richard Elwes

We consider a preferential attachment process in which a multigraph is built one node at a time. The number of edges added at stage , emanating from the new node, is given by so…

cs.GT2013

Tipping Points in Schelling Segregation

George Barmpalias, Richard Elwes, Andy Lewis-Pye

One of the earliest agent-based economical models, Schelling's spacial proximity model illustrated how global segregation can emerge, often unwanted, from the actions of agents of…