Searcharxiv⌕ Search

arXiv subjects

Şirag Erkol

Publications and source records attributed to Şirag Erkol.

3 recordsLinked to original sources

Crowding controls the scaling of bus frequency with demand

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 \sim (d/t)^α$ with exponent $α\in [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-minute reduction in daily waiting time per passenger in Boston, compared to only about 1 minute 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.

physics.soc-ph↗

Who is the best coach of all time? A network-based assessment of the career performance of professional sports coaches

We consider two large datasets consisting of all games played among top-tier European soccer clubs in the last 60 years, and among professional American basketball teams in the past 70 years. We leverage game data to build networks of pairwise interactions between the head coaches of the teams, and measure their career performance in terms of network centrality metrics. We identify Arsene Wenger, Sir Alex Ferguson, Jupp Heynckes, Carlo Ancelotti, and Jose Mourinho as the top 5 European soccer coaches of all time. In American basketball, the first 5 positions of the all-time ranking are occupied by Red Auerbach, Gregg Popovich, Phil Jackson, Don Nelson, and Lenny Wilkens. We further establish rankings by decade and season. We develop a simple methodology to monitor performance throughout a coach's career, and to dynamically compare the performance of two or more coaches at a given time. The manuscript is accompanied by the website coachscore.luddy.indiana.edu where complete results of our analysis are accessible to the interested readers.

physics.soc-ph↗

Influence maximization in noisy networks

We consider the problem of identifying the most influential nodes for a spreading process on a network when prior knowledge about structure and dynamics of the system is incomplete or erroneous. Specifically, we perform a numerical analysis where the set of top spreaders is determined on the basis of prior information that is artificially altered by a certain level of noise. We then measure the optimality of the chosen set by measuring its spreading impact in the true system. Whereas we find that the identification of top spreaders is optimal when prior knowledge is complete and free of mistakes, we also find that the quality of the top spreaders identified using noisy information doesn't necessarily decrease as the noise level increases. For instance, we show that it is generally possible to compensate for erroneous information about dynamical parameters by adding synthetic errors in the structure of the network. Further, we show that, in some dynamical regimes, even completely losing prior knowledge on network structure may be better than relying on certain but incomplete information.

physics.soc-ph↗