642 citations · 794 across the 21 of their papers we have counts for
23 papers
Optimal Strategies to Contain and Prevent the Spread of Diseases in Group-structured Populations
Varun K. Rao, Siddharth Patwardhan, Filippo Radicchi
The strength and speed of an epidemic process in a multiplex network is affected by how modular the networks in each layer are. However, it is not obvious how the dynamics of the s…
Evaluating LLM-Generated Preference Distributions
Fan Huang, Minsuk Kim, C. Tyler Diggans +1
Large Language Models (LLMs) are increasingly used as probabilistic generators for simulation, synthetic data generation, and decision support in settings where real-world data are…
Deep-learning-aided dismantling of interdependent networks
Weiwei Gu, Chen Yang, Lei Li +2
Identifying the minimal set of nodes whose removal breaks a complex network apart, also referred as the network dismantling problem, is a highly non-trivial task with applications…
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…
Criticality and universality in network dismantling
Lorenzo Cirigliano, Claudio Castellano, Minsuk Kim +2
Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications…
Efficient generation of networks with minimal average shortest-path distance
Meritxell Vila-Miñana, Filippo Radicchi
Designing networks that minimize distances and satisfy structural constraints is a fundamental task across transportation, communication, and biological systems. Here, we consider…
Dynamical processes and emergent behaviors in multiplex networks
Federico Battiston, Mattia Frasca, Jesus Gómez-Gardeñes +4
Over the last two decades, network science has greatly advanced our understanding of how the collective behaviors of a complex system emerge from the interactions among its basic u…
Robustness in sparse artificial neural networks trained with adaptive topology
Bendegúz Sulyok, Gergely Palla, Filippo Radicchi +1
We investigate the robustness of sparse artificial neural networks trained with adaptive topology. We focus on a simple yet effective architecture consisting of three sparse layers…
Modeling plant disease spread via high-resolution human mobility networks
Varun K. Rao, Ryan Higgs, Hautahi Kingi +3
Human mobility plays a crucial role in the spread of human diseases, but is rarely quantified in plant disease epidemics. To address this gap, we integrate a unique, high-resolutio…
Detectability threshold in weighted modular networks
Filippo Radicchi, Filipi N. Silva, Alessandro Flammini +2
We study the necessary condition to detect, by means of spectral modularity optimization, the ground-truth partition in networks generated according to the weighted planted-partiti…
Scale invariance and statistical significance in complex weighted networks
Filipi N. Silva, Sadamori Kojaku, Alessandro Flammini +2
Most networks encountered in nature, society, and technology have weighted edges, representing the strength of the interaction/association between their vertices. Randomizing the s…
Triadic percolation on multilayer networks
Hanlin Sun, Filippo Radicchi, Ginestra Bianconi
Triadic interactions are special types of higher-order interactions that occur when regulator nodes modulate the interactions between other two or more nodes. In presence of triadi…
Robustness and resilience of complex networks
Oriol Artime, Marco Grassia, Manlio De Domenico +5
Complex networks are ubiquitous: a cell, the human brain, a group of people and the Internet are all examples of interconnected many-body systems characterized by macroscopic prope…
Shortest-path percolation on scale-free networks
Minsuk Kim, Lorenzo Cirigliano, Claudio Castellano +4
The shortest-path percolation (SPP) model aims at describing the consumption and eventual exhaustion of a network's resources. Starting from a network containing a macroscopic conn…
Task complexity shapes internal representations and robustness in neural networks
Robert Jankowski, Filippo Radicchi, M. Ángeles Serrano +2
Neural networks excel across a wide range of tasks, yet remain black boxes. In particular, how their internal representations are shaped by the complexity of the input data and the…
Modeling individual attention dynamics on online social media
Jaume Ojer, Filippo Radicchi, Santo Fortunato +2
In the attention economy, understanding how individuals manage limited attention is critical. We introduce a simple model describing the decay of a user's engagement when facing mu…
Modeling resource consumption in the US air transportation system via minimum-cost percolation
Minsuk Kim, C. Tyler Diggans, Filippo Radicchi
We introduce a dynamic percolation model aimed at describing the consumption, and eventual exhaustion, of resources in transportation networks. In the model, rational agents progre…
Efficient inference of rankings from multi-body comparisons
Jack Yeung, Daniel Kaiser, Filippo Radicchi
Many of the existing approaches to assess and predict the performance of players, teams or products in competitive contests rely on the assumption that comparisons occur between pa…
Parallel Algorithms for Median Consensus Clustering in Complex Networks
Md Taufique Hussain, Mahantesh Halappanavar, Samrat Chatterjee +3
We develop an algorithm that finds the consensus of many different clustering solutions of a graph. We formulate the problem as a median set partitioning problem and propose a gree…
Shortest-path percolation on random networks
Minsuk Kim, Filippo Radicchi
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting…
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…
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…
Lévy flights in human behavior and cognition
Andrea Baronchelli, Filippo Radicchi
Lévy flights represent the best strategy to randomly search for a target in an unknown environment, and have been widely observed in many animal species. Here, we inspect and discu…