44 citations · 93 across the 8 of their papers we have counts for
8 papers
Crowding controls the scaling of bus frequency with demand
Siddharth Patwardhan, Şirag Erkol, Filippo Radicchi +1
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…
Symmetry breaking in optimal transport networks
Siddharth Patwardhan, Marc Barthelemy, Sirag Erkol +2
Despite its importance for practical applications, not much is known about the optimal shape of a network that connects in an efficient way a set of points. This problem can be for…
Consistency pays off in science
Sirag Erkol, Satyaki Sikdar, Filippo Radicchi +1
The exponentially growing number of scientific papers stimulates a discussion on the interplay between quantity and quality in science. In particular, one may wonder which publicat…
Effective submodularity of influence maximization on temporal networks
Sirag Erkol, Dario Mazzilli, Filippo Radicchi
We study influence maximization on temporal networks. This is a special setting where the influence function is not submodular, and there is no optimality guarantee for solutions a…
Who is the best coach of all time? A network-based assessment of the career performance of professional sports coaches
Şirag Erkol, Filippo Radicchi
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 pas…
Influence maximization on temporal networks
Sirag Erkol, Dario Mazzilli, Filippo Radicchi
We consider the optimization problem of seeding a spreading process on a temporal network so that the expected size of the resulting outbreak is maximized. We frame the problem for…
Systematic comparison between methods for the detection of influential spreaders in complex networks
Sirag Erkol, Claudio Castellano, Filippo Radicchi
Influence maximization is the problem of finding the set of nodes of a network that maximizes the size of the outbreak of a spreading process occurring on the network. Solutions to…
Influence maximization in noisy networks
Şirag Erkol, Ali Faqeeh, Filippo Radicchi
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…