Abstract: The navigation of urban road networks is essential to the transportation of billions of people and trillions of dollars worth of goods each year. In this project we seek to understand these networks through a geometric lens. We examine the effectiveness of greedy routing in ten major cities to establish a connection between network structure and space. We find the effectiveness of greedy routing varies across cities, and we explore which factors contribute to greedy routing success. Our analysis reveals that routing in road networks using the underlying Euclidean geometry is fairly efficient compared with road networks that have been rewired, which supports our claim that roads networks are essentially Euclidean in their structure.
Video:
Live Poster Session:
Thursday, July 29th 1:15-2:30pm EDT