20.500.12556/RUL-166865 Node importance corresponds to passenger demand in public transport networks We investigate the correspondence between network-based public transport network (PTN) supply indicators and passenger demand at the node level, by systematically assessing correlations between node centrality measures and passenger boarding counts across different graph representations of PTNs. At the stop-level, undirected L- and P-space representations with three different edge weightings: unweighted, service-frequency-weighted, and in-vehicle-time-weighted are analysed. In each case, we calculate degree, closeness, betweenness and eigenvector centralities and examine the relation shapes. At the route level, we examine degree and eigenvector centrality for unweighted and weighted C-space representations. We introduce a modified C-space representation with self-loops, with service frequencies as self-loop weights, and propose eigenvector centrality as a route-level supply indicator. Stop- and route-level properties are integrated using the B-space representation. This methodology was applied to a case study for a bus PTN in Ljubljana, Slovenia. Results show strong correspondence between passenger demand and degree and eigenvector centrality scores in the frequency-weighted P-space (correlation ≈ 0.7 − 0.8). Notably, the relationship between eigenvector centrality and passenger counts in the new C-space representation with self-loops exhibits logarithmic behaviour. Furthermore, the results suggest a minimum eigenvector centrality threshold (≈ 10$^{−3}$) for a route to start facilitating passenger use. The route-level results from the B-space analysis show exponential convergence of passenger counts to route eigenvector centrality. Results of the stop-level analysis are in line with previous research and deepen the understanding of centrality measures as supply indicators. Most significantly, the route-level analysis is novel, and the results open promising venues for further research. public transport graph theory network science General Transit Feed Specification GTFS smart card data node centrality javni prevoz teorija grafov znanost o omrežjih splošne specifikacije tranzitnega vira GTFS podatki pametne kartice true false true Angleški jezik Slovenski jezik Članek v reviji 2025-01-28 11:21:12 2025-01-28 11:21:14 2025-01-29 03:57:05 0000-00-00 00:00:00 2025 0 0 18 str. art. 130354 Vol. 659 Feb. 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17:004 0378-4371 10.1016/j.physa.2025.130354 221377539 1-s2.0-S0378437125000068-main.pdf 1-s2.0-S0378437125000068-main.pdf 1 8EE37C9EAB76B262B438854E9DFDF245 0efc7adbd9aca08761e2440fcdd0c87c920f28342125650d3a3a9ae0d14cfeb9 47c7ffbd-dd61-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=198827 https://www.sciencedirect.com/science/article/pii/S0378437125000068 1 ca93526d-dd60-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=198826 Fakulteta za pomorstvo in promet Fakulteta za strojništvo 0 0 0