Commuting network effect on urban wealth scaling

The urban desirability paradox: U.K. urban-rural differences in well-being, social satisfaction, and economic satisfaction

As the majority of the global population resides in cities, it is imperative to understand urban well-being. While cities offer concentrated social and economic opportunities, the question arises whether these benefits translate to equitable levels of satisfaction in these domains. Using a robust and objective measure of urbanicity on a sample of 156,000 U.K. residents aged 40 and up, we find that urban living is associated with lower scores across seven dimensions of well-being, social satisfaction, and economic satisfaction. In addition, these scores exhibit greater variability within urban areas, revealing increased inequality. Last, we identify optimal distances in the hinterlands of cities with the highest satisfaction and the least variation. Our findings raise concern for the psychological well-being of urban residents and show the importance of nonlinear methods in urban research.

A global empirical study on how street networks facilitate driving longer distances

We simulated over 200 cities worldwide to investigate how the street network affects vehicle routes. We demonstrate that there is a ubiquitous super-linear relationship between time and distance when optimal route are chosen. More precisely, the average speed will be higher for longer trips when compared to shorter trips, showing that the street network makes driving further faster. We attribute this phenomenon to the spatial arrangement of extensive street segments that eliminate deceleration points. These results underscore the importance for cities to consider the distribution of deceleration-free streets while mitigating any negative impact on sustainability. To ensure efficient transportation planning and engineering, innovative approaches are necessary to facilitate the flow of goods and services while adhering to sustainable mobility principles.

A Global Feature-Rich Network Dataset of Cities and Dashboard for Comprehensive Urban Analyses

Urban network analytics has become an essential tool for understanding and modeling the intricate complexity of cities. We introduce the Urbanity data repository to nurture this growing research field, offering a comprehensive, open spatial network resource spanning 50 major cities in 29 countries worldwide. Our workflow enhances OpenStreetMap networks with 40 + high-resolution indicators from open global sources such as street view imagery, building morphology, urban population, and points of interest, catering to a diverse range of applications across multiple fields. We extract streetscape semantic features from more than four million street view images using computer vision. The dataset's strength lies in its thorough processing and validation at every stage, ensuring data quality and consistency through automated and manual checks. Accompanying the dataset is an interactive, web-based dashboard we developed which facilitates data access to even non-technical stakeholders. Urbanity aids various GeoAI and city comparative analyses, underscoring the growing importance of urban network analytics research.

The distance backbone of directed networks

In weighted graphs the shortest path between two nodes is often reached through an indirect path, out of all possible connections, leading to structural redundancies which play key roles in the dynamics and evolution of complex networks. We have previously developed a parameter-free, algebraically-principled methodology to uncover such redundancy and reveal the distance backbone of weighted graphs, which has been shown to be important in transmission dynamics, inference of important paths, and quantifying the robustness of networks. However, the method was developed for undirected graphs. Here we expand this methodology to weighted directed graphs and study the redundancy and robustness found in nine networks ranging from social, biomedical, and technical systems. We found that similarly to undirected graphs, directed graphs in general also contain a large amount of redundancy, as measured by the size of their (directed) distance backbone. Our methodology adds an additional tool to the principled sparsification of complex networks and the measure of their robustness.