Identifying Important Nodes in Trip Networks and Investigating Their Determinants

Abstract

Describing travel patterns and identifying significant locations is a crucial area of research in transportation geography and social dynamics. Our study aims to contribute to this field by analyzing taxi trip data from Chengdu and New York City. Specifically, we investigate the probability density distribution of trip distance in each city, which enables us to construct long- and short-distance trip networks. To identify critical nodes within these networks, we employ the PageRank algorithm and categorize them using centrality and participation indices. Furthermore, we explore the factors that contribute to their influence and observe a clear hierarchical multi-centre structure in Chengdu's trip networks, while no such phenomenon is evident in New York City's. Our study provides insight into the impact of trip distance on important nodes within trip networks in both cities and serves as a reference for distinguishing between long and short taxi trips. Our findings also reveal substantial differences in network structures between the two cities, highlighting the nuanced relationship between network structure and socio-economic factors. Ultimately, our research sheds light on the underlying mechanisms shaping transportation networks in urban areas and offers valuable insights into urban planning and policy making.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 2 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.