Crowding controls the scaling of bus frequency with demand

S Siddharth Patwardhan (Center for Science of Science and Innovation, Kellogg School of Management, Northwestern University) Şirag Erkol (Center for Science of Science and Innovation, Kellogg School of Management, Northwestern University) F Filippo Radicchi (Center for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University) M Marc Barthelemy (Institut de Physique Théorique, Université Paris-Saclay, Commissariat à l’énergie atomique et aux énergies alternatives, CNRS)

Abstract

Cities must allocate limited resources to maintain mobility, with uncertainties about the resulting state of the system. Analyzing roughly 3,000 bus routes with more than 4 billion yearly riders across 19 metropolitan areas worldwide, we uncover a robust scaling law of the form f ∼ ( d / t ) α with exponent α ∈ [ 1 / 2 , 2 / 3 ] , linking the service frequency f to passenger demand d and route duration t . We show that this scaling emerges from a simple optimization principle: Cities implicitly minimize total passenger waiting time under a fixed operational budget when both schedule frequency and crowding are taken into account. This mechanism produces two universal regimes: a frequency-dominated regime with α = 1 / 2 when crowding is negligible and a capacity-dominated regime with α = 2 / 3 when most routes are overloaded. Intermediate exponents arise when only part of the network operates near capacity. Furthermore, we find that the benefits of additional investment are highly uneven across systems. For instance, our model suggests that a 20 % budget increase yields nearly a 5-min reduction in daily waiting time per passenger in Boston, compared to only about 1 min in Paris. These findings place urban transit within a broader class of constrained capacity-allocation problems, while highlighting a distinct regime in which prescribed route demands shape the allocation of limited service resources. The resulting scaling laws show how simple optimization principles can generate systematic exponents in complex transport systems, beyond the dissipation-based frameworks usually considered in physical and biological flow networks.

Article Details

Volume / Issue Vol. 123, Issue 29
Published July 21, 2026
ISSN 0027-8424
Publisher National Academy of Sciences

Authors (4)

S

Siddharth Patwardhan

Center for Science of Science and Innovation, Kellogg School of Management, Northwestern University

Şirag Erkol

Center for Science of Science and Innovation, Kellogg School of Management, Northwestern University

F

Filippo Radicchi

Center for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University

M

Marc Barthelemy

Institut de Physique Théorique, Université Paris-Saclay, Commissariat à l’énergie atomique et aux énergies alternatives, CNRS