.png){kind=icon}
.png){kind=icon}
Return
Surfacic networks
.png){kind=icon}
OA
AI
DOI：10.1093/pnasnexus/pgae585.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Surfacic networks are structures built upon a 2D manifold. Many systems, including transportation networks and various urban networks, fall into this category. The fluctuations of node elevations imply significant deviations from typical plane networks and require specific tools to understand their impact. Here, we present such tools, including lazy paths that minimize elevation differences, graph arduousness which measures the tiring nature of shortest paths (SPs), and the excess effort, which characterizes positive elevation variations along SPs. We illustrate these measures using toy models of surfacic networks and empirically examine pedestrian networks in selected cities. Specifically, we examine how changes in elevation affect the spatial distribution of betweenness centrality. We also demonstrate that the excess effort follows a nontrivial power law distribution, with an exponent that is not universal, which illustrates that there is a significant probability of encountering steep slopes along SPs, regardless of the elevation difference between the starting point and the destination. These findings highlight the significance of elevation fluctuations in shaping network characteristics. Surfacic networks offer a promising framework for comprehensively analyzing and modeling complex systems that are situated on or constrained to a surface environment.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
3.8
Papers:
2.1K
Citations:
3.2K
Organization
C
View more organizations