activity
20152026
most citedEpidemic spreading in group-structured populations

11 citations · 47 across the 10 of their papers we have counts for

collaborators

10 papers

physics.soc-ph2026★ 1 cited

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…

physics.soc-ph2025★ 4 cited

Multilayer network science: theory, methods, and applications

Alberto Aleta, Andreia Sofia Teixeira, Guilherme Ferraz de Arruda +14

Multilayer network science has emerged as a central framework for analysing interconnected and interdependent complex systems. Its relevance has grown substantially with the increa…

physics.soc-ph2023

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…

physics.soc-ph2023★ 8 cited

Reconstruction of multiplex networks via graph embeddings

Daniel Kaiser, Siddharth Patwardhan, Minsuk Kim +1

Multiplex networks are collections of networks with identical nodes but distinct layers of edges. They are genuine representations for a large variety of real systems whose element…

physics.soc-ph2023★ 11 cited

Epidemic spreading in group-structured populations

Siddharth Patwardhan, Varun K. Rao, Santo Fortunato +1

Individuals involved in common group activities/settings -- e.g., college students that are enrolled in the same class and/or live in the same dorm -- are exposed to recurrent cont…

physics.soc-ph2022★ 3 cited

Machine Learning as an Accurate Predictor for Percolation Threshold of Diverse Networks

Siddharth Patwardhan, Utso Majumder, Aditya Das Sarma +3

The percolation threshold is an important measure to determine the inherent rigidity of large networks. Predictors of the percolation threshold for large networks are computational…

physics.soc-ph2022★ 5 cited

Influence Maximization: Divide and Conquer

Siddharth Patwardhan, Filippo Radicchi, Santo Fortunato

The problem of influence maximization, i.e., finding the set of nodes having maximal influence on a network, is of great importance for several applications. In the past two decade…

physics.soc-ph2022★ 5 cited

Multiplex reconstruction with partial information

Daniel Kaiser, Siddharth Patwardhan, Filippo Radicchi

A multiplex is a collection of network layers, each representing a specific type of edges. This appears to be a genuine representation for many real-world systems. However, due to…

physics.soc-ph2019

Quantifying Dismantlement in Disconnected Networks

Siddharth Patwardhan

We propose a novel measure to quantify dismantlement of a fragmented network. The existing measure of dismantlement used to study problems like optimal percolation is usually the s…

quant-ph2015★ 10 cited

Efficient Controlled Quantum Secure Direct Communication Protocols

Siddharth Patwardhan, Subhayan Roy Moulick, Prasanta K. Panigrahi

We study controlled quantum secure direct communication (CQSDC), a cryptographic scheme where a sender can send a secret bit-string to an intended recipient, without any secure cla…