Quantifying ethnic segregation in cities through random walks

<p><strong>Overview</strong></p> <p>This repository contains the coverage time distributions&nbsp;used to produce the figures and statistics&nbsp;for the paper:</p> <p>S. Sousa, V. Nicosia &quot;Quantifying ethnic segregation in cities through random walks&quot;. arXiv:&nbsp;<a href="https://arxiv.org/abs/2010.10462">https://arxiv.org/abs/2010.10462</a></p> <p><strong>Data</strong></p> <p>The <strong>ccp.zip</strong> 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:</p> <pre><code>"Node ID" "[list with the CCT for each fraction c]"</code></pre> <p>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.</p> <p>The <strong>dfa.zip file</strong> contains the following folders:</p> <ul> <li><strong>distances:</strong>&nbsp;each line corresponds to one repetition of the walk, it shows the area&nbsp;travelled by the walker, the length of the trajectory and perimeter.</li> <li><strong>exponents:&nbsp;</strong>&nbsp;The output file contains two columns, respectively for \epsilon and F(\epsilon).</li> <li><strong>results_ids</strong>:&nbsp; Time series of the visited nodes</li> </ul> <p>The <strong>synthetic.zip</strong> 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.</p> <p>&nbsp;</p> <p><strong>Code</strong></p> <p>The reader interested in replicating the methods used to create the data can obtain the python scrips in the following repository:</p> <p><a href="https://github.com/segregation-rw/ethnic-segregation-rw">https://github.com/segregation-rw/ethnic-segregation-rw</a></p> <p>Note that the repository also includes the code to simulate the CCT&nbsp;random walks on the adjacency&nbsp;graphs so that the whole simulation can be replicated.</p>