Quantifying ethnic segregation in cities through random walks

Overview

This repository contains the coverage time distributions used to produce the figures and statistics for the paper:

S. Sousa, V. Nicosia "Quantifying ethnic segregation in cities through random walks". arXiv: https://arxiv.org/abs/2010.10462

Data

The ccp.zip file contains two subfolders with the coverage time distributions for the US and UK systems. Each file contains a line per node of the network with the format:

"Node ID" "[list with the CCT for each fraction c]"

Note that each line will always contain 101 columns where the first column identifies the node and the remaining ones represent the average coverage time to reach a fraction c of classes.

The dfa.zip file contains the following folders:

distances: each line corresponds to one repetition of the walk, it shows the area travelled by the walker, the length of the trajectory and perimeter.

exponents:  The output file contains two columns, respectively for \epsilon and F(\epsilon).

results_ids:  Time series of the visited nodes

The synthetic.zip file contains the coverage time distributions for the experiment with different lattice sizes (scale-test) and the experiment with distinct spatial patterns for the population distribution (topology-test). The format follows the same as in ccp.zip folder.

Code

The reader interested in replicating the methods used to create the data can obtain the python scrips in the following repository:

https://github.com/segregation-rw/ethnic-segregation-rw

Note that the repository also includes the code to simulate the CCT random walks on the adjacency graphs so that the whole simulation can be replicated.