Skip to content

Latest commit

 

History

History
12 lines (8 loc) · 967 Bytes

README.md

File metadata and controls

12 lines (8 loc) · 967 Bytes

Developing optimal bicycle network growth strategies

Binder

This repository contains the code to replicate the algorithms and measures in the paper Natera, L.G., Battiston, F., Iñiguez, G., and Szell, M. "Data-driven strategies for optimal bicycle network growth", 2019.

Guide

  1. 01_Multiplex.ipynb --> Takes the multilayer networks for the fifteen different cities and calculates their corresponding overlap census.
  2. 02_BicycleAlgorithms.ipynb --> Deploy the algorithms L2C, L2S, CC, and R2C to grow bicycle networks and calculates the bicycle-car directness.
  3. 03_Plots.ipynb --> Makes the plots with the measures of the algorithms.

The data we used for the analysis is available at Harvard Dataverse.