SearcharxivSearch

arXiv subjects

Filippo Radicchi

Publications and source records attributed to Filippo Radicchi.

At least 19 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)^\alpha$ with exponent $\alpha \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 $\alpha = 1/2$ when crowding is negligible, and a capacity-dominated regime with $\alpha = 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

Criticality and universality in network dismantling

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. Whereas network dismantling has been extensively studied over the past decade, most work has focused on developing efficient algorithms for large but finite networks. By contrast, the physics of the network dismantling process, namely how the network structural connectivity is affected by the removal of nodes or edges, remains largely unexplored in the thermodynamic limit. Here, we shed light on this understudied aspect of network dismantling by introducing an adaptive biased percolation process able to optimally dismantle a network. Through a systematic analysis of synthetic network models, we find that the proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions. Simulations on real networks further support this universality, indicating that the physics of network dismantling is insensitive to a broad range of topological properties. Together, these results suggest that a topology-agnostic theory could be developed to explain the critical behavior of network dismantling.

physics.soc-ph

Efficient generation of networks with minimal average shortest-path distance

Designing networks that minimize distances and satisfy structural constraints is a fundamental task across transportation, communication, and biological systems. Here, we consider the problem of finding, for a given degree sequence, the network structure displaying the smallest possible average shortest-path length. While exact solutions are available in linear time for trees, such an optimization problem becomes computationally infeasible as soon as loops are allowed in the networks. We propose a fast algorithm to construct approximate solutions to such a degree-constrained distance-minimization problem. Accordingly, edges are first created between high-degree nodes; then, additional connections are placed following the rules of the standard configuration model. In spite of its simplicity, the algorithm displays outstanding performance as demonstrated in our systematic experiments on both synthetic and real degree sequences. Our method is particularly effective on synthetic degree sequences displaying medium levels of heterogeneity. When applied to degree sequences of real networks, the proposed algorithm is able to reduce the all-pair shortest path of real structures by 20%, on average. We perform a validation on small-sized networks, where we compare the shortest-path distance of the networks generated with our algorithm against those obtained via simulated annealing optimization. Although simulated annealing yields slightly better structures, our proposed algorithm provides nearly identical solutions at a substantially lower computational cost, making it a solid method in applications concerning large-scale systems.

physics.soc-ph

Enabling quantum communication in ultra-large-scale networks

The recent development of small-scale quantum networks poses the question of whether such a technology could also operate at scale in the futuristic Quantum Internet. The question can be answered with a classical approach where an arbitrary quantum network is represented as a classical graph, and communication reliability is assessed using methods proper of network theory. Unfortunately, sufficient conditions for viable network-wide communication have been established only for special topologies like regular lattices. No practical communication protocols have been developed so far for real network topologies, if not for relatively small networks. Here, we overcome these limitations by devising a family of quantum communication protocols that can be applied to networks with arbitrary topology, composed of even hundreds of millions nodes. By performing a systematic analysis on both real and synthetic graphs, we show that the proposed protocols are sustainable on heterogeneous networks. For random scale-free graphs, we analytically prove that viable quantum communication persists in the thermodynamic limit. Our findings provide evidence that the Quantum Internet will be capable of sustaining a ultra-large-scale growth comparable to one already experienced by its classical predecessor.

physics.soc-ph

Dynamical processes and emergent behaviors in multiplex networks

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 units. Multiplex networks, i.e. networks with many layers, whose nodes are in one-to-one correspondence, provide a more realistic description for social, biological and ecological systems where multiple types of interactions coexist. After a brief introduction on how to model the architecture of multiplex networks, we present a complete overview of the different dynamics which can unfold over these structures. We present a unified framework to describe dynamical processes such as percolation, reaction-diffusion, synchronization, epidemic spreading, social dynamics and games on multiplex networks, as well as the coupled evolution of different dynamical processes, and the coevolution of a process with the network structure. Our focus is on truly-multiplex collective behaviors, i.e., all those phenomena which cannot emerge on the corresponding aggregated networks, or when the different layers of these systems are considered in isolation. We identify three main mechanisms leading to new collective behaviors: the existence of structural correlations across layers, the presence of dynamical correlations in the processes taking place at the different layers, and the dynamical interplay of inter- and intra-layer interactions. We conclude with a summary of the main takeaways from a decade of work in the field.

physics.soc-ph

Modeling plant disease spread via high-resolution human mobility networks

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-resolution network of human movements in New Zealand with a metapopulation model to mechanistically simulate pathogen transmission. We calibrate the model on the nationwide 2010 kiwifruit vine disease (Psa-V) outbreak, and show that it accurately reproduces the observed spatiotemporal spread, confirming that the human mobility network is a strong foundation for modeling transmission dynamics. By analyzing spatial infection trends, we find that most dispersal occurs locally, as often illustrated in the plant-outbreak literature. However, sporadic long-range connections are necessary to model a nationwide outbreak. Using the model as an in-silico laboratory, we demonstrate that enhanced surveillance accelerates detection and that outbreak severity is highly sensitive to the timing and location of initial disease importation. We observe a potential causal link between seasonal labor patterns and epidemic risk in high-traffic seasons. This study provides a robust, data-driven framework for modeling and predicting the spatiotemporal spread of agricultural pathogens. It underscores the importance of leveraging human mobility networks to design timely interventions and surveillance systems, protecting global food security.

physics.soc-ph

Robustness in sparse artificial neural networks trained with adaptive topology

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 with 99% sparsity followed by a dense layer, applied to image classification tasks such as MNIST and Fashion MNIST. By updating the topology of the sparse layers between each epoch, we achieve competitive accuracy despite the significantly reduced number of weights. Our primary contribution is a detailed analysis of the robustness of these networks, exploring their performance under various perturbations including random link removal, adversarial attack, and link weight shuffling. Through extensive experiments, we demonstrate that adaptive topology not only enhances efficiency but also maintains robustness. This work highlights the potential of adaptive sparse networks as a promising direction for developing efficient and reliable deep learning models.

cs.LG

Detectability threshold in weighted modular networks

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-partition model with two equally sized communities. We analytically derive a general expression for the maximum level of mixing tolerated by the algorithm to retrieve community structure, showing that the value of this detectability threshold depends on the first two moments of the distributions of node degree and edge weight. We focus on the standard case of Poisson-distributed node degrees and compare the detectability thresholds of five edge-weight distributions: Dirac, Poisson, exponential, geometric, and signed Bernoulli. We show that Dirac distributed weights yield the smallest detectability threshold, while exponentially distributed weights increase the threshold by a factor $\sqrt{2}$, with other distributions exhibiting distinct behaviors that depend, either or both, on the average values of the degree and weight distributions. Our results indicate that larger variability in edge weights can make communities less detectable. In cases where edge weights carry no information about community structure, incorporating weights in community detection is detrimental.

physics.soc-ph

Scale invariance and statistical significance in complex weighted networks

Most networks encountered in nature, society, and technology have weighted edges, representing the strength of the interaction/association between their vertices. Randomizing the structure of a network is a classic procedure used to estimate the statistical significance of properties of the network, such as transitivity, centrality and community structure. Randomization of weighted networks has traditionally been done via the weighted configuration model (WCM), a simple extension of the configuration model, where weights are interpreted as bundles of edges. It has previously been shown that the ensemble of randomizations provided by the WCM is affected by the specific scale used to compute the weights, but the consequences for statistical significance were unclear. Here we find that statistical significance based on the WCM is scale-dependent, whereas in most cases results should be independent of the choice of the scale. More generally, we find that designing a null model that does not violate scale invariance is challenging. A two-step approach, originally introduced for network reconstruction, in which one first randomizes the structure, then the weights, with a suitable distribution, restores scale invariance, and allows us to conduct unbiased assessments of significance on weighted networks.

physics.soc-ph

Triadic percolation on multilayer networks

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 triadic interactions, a percolation process occurring on a single-layer network becomes a fully-fledged dynamical system, characterized by period-doubling and a route to chaos. Here, we generalize the model to multilayer networks and name it as the multilayer triadic percolation (MTP) model. We find a much richer dynamical behavior of the MTP model than its single-layer counterpart. MTP displays a Neimark-Sacker bifurcation, leading to oscillations of arbitrarily large period or pseudo-periodic oscillations. Moreover, MTP admits period-two oscillations without negative regulatory interactions, whereas single-layer systems only display discontinuous hybrid transitions. This comprehensive model offers new insights on the importance of regulatory interactions in real-world systems such as brain networks, climate, and ecological systems.

nlin.AO

Robustness and resilience of complex networks

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 properties that cannot be trivially deduced from those of their microscopic constituents. Such systems are exposed to both internal, localized, failures and external disturbances or perturbations. Owing to their interconnected structure, complex systems might be severely degraded, to the point of disintegration or systemic dysfunction. Examples include cascading failures, triggered by an initially localized overload in power systems, and the critical slowing downs of ecosystems which can be driven towards extinction. In recent years, this general phenomenon has been investigated by framing localized and systemic failures in terms of perturbations that can alter the function of a system. We capitalize on this mathematical framework to review theoretical and computational approaches to characterize robustness and resilience of complex networks. We discuss recent approaches to mitigate the impact of perturbations in terms of designing robustness, identifying early-warning signals and adapting responses. In terms of applications, we compare the performance of the state-of-the-art dismantling techniques, highlighting their optimal range of applicability for practical problems, and provide a repository with ready-to-use scripts, a much-needed tool set.

physics.soc-ph

Shortest-path percolation on scale-free networks

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 connected component, random pairs of nodes are sequentially selected, and if the length of the shortest path connecting the node pairs is smaller than a tunable budget parameter, then all edges along such a path are removed from the network. As edges are progressively removed, the network eventually breaks into multiple microscopic components, undergoing a percolation-like transition. It is known that SPP transition on Erd\H{o}s-R\'enyi networks (ERNs) belongs to same universality class as of the ordinary bond percolation if the budget parameter is finite; for unbounded budget, instead, the SPP transition becomes more abrupt than the ordinary percolation transition. By means of large-scale numerical simulations and finite-size scaling analysis, here we study the SPP transition on random scale-free networks (SFNs) characterized by power-law degree distributions. We find, in contrast with ordinary percolation, that the transition is identical to the one observed on ERNs, denoting independence from the degree exponent. Still, we distinguish finite- and infinite-budget SPP universality classes. Our findings follow from the fact that the SPP process drastically homogenizes the heterogeneous structure of SFNs before the SPP transition takes place.

physics.soc-ph

Task complexity shapes internal representations and robustness in neural networks

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 problems they solve remains obscure. In this work, we introduce a suite of five data-agnostic probes-pruning, binarization, noise injection, sign flipping, and bipartite network randomization-to quantify how task difficulty influences the topology and robustness of representations in multilayer perceptrons (MLPs). MLPs are represented as signed, weighted bipartite graphs from a network science perspective. We contrast easy and hard classification tasks on the MNIST and Fashion-MNIST datasets. We show that binarizing weights in hard-task models collapses accuracy to chance, whereas easy-task models remain robust. We also find that pruning low-magnitude edges in binarized hard-task models reveals a sharp phase-transition in performance. Moreover, moderate noise injection can enhance accuracy, resembling a stochastic-resonance effect linked to optimal sign flips of small-magnitude weights. Finally, preserving only the sign structure-instead of precise weight magnitudes-through bipartite network randomizations suffices to maintain high accuracy. These phenomena define a model- and modality-agnostic measure of task complexity: the performance gap between full-precision and binarized or shuffled neural network performance. Our findings highlight the crucial role of signed bipartite topology in learned representations and suggest practical strategies for model compression and interpretability that align with task complexity.

cs.LG

Modeling individual attention dynamics on online social media

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 multiple inputs. We analytically show that individual attention decay is determined by the overall duration of interactions, not their number or user activity. Our model is validated using data from Reddit's Change My View subreddit, where the user's attention dynamics is explicitly traceable. Despite its simplicity, our model offers a crucial microscopic perspective complementing macroscopic studies.

physics.soc-ph

Modeling resource consumption in the US air transportation system via minimum-cost percolation

We introduce a dynamic percolation model aimed at describing the consumption, and eventual exhaustion, of resources in transportation networks. In the model, rational agents progressively consume the edges of a network along demanded minimum-cost paths. As a result, the network undergoes a transition between a percolating phase where it can properly serve demand to a non-percolating phase where demand can no longer be supplied. We apply the model to a weighted, directed, temporal, multi-layer network representation of the air transportation system that can be generated using real schedules of commercial flights operated by US carriers. We study how cooperation among different carriers could improve the ability of the overall air transportation system in serving the demand of passengers, finding that unrestricted cooperation could lead to a 30% efficiency increase compared to the non-cooperative scenario. Cooperation would require major airlines to share a significant portion of their market, but it would allow also for an increased robustness of the system against perturbations causing flight cancellations. Our findings underscore some key benefits that could emerge by simply promoting code-share arrangements among US airlines without altering their current cost of operation.

physics.soc-ph

Efficient inference of rankings from multi-body comparisons

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 pairs of such entities. There are, however, several real contests where more than two entities are part of each comparison, e.g., sports tournaments,multiplayer board and card games, and preference surveys. The Plackett-Luce (PL) model provides a principled approach to infer the ranking of entities involved in such contests characterized by multi-body comparisons. Unfortunately, traditional algorithms used to compute PL rankings suffer from slow convergence limiting the application of the PL model to relatively small-scale systems. We present here an alternative implementation that allows for significant speed-ups and validate its efficiency in both synthetic and real-world sets of data. Further, we perform systematic cross-validation tests concerning the ability of the PL model to predict unobserved comparisons. We find that a PL model trained on a set composed of multi-body comparisons is more predictive than a PL model trained on a set of projected pairwise comparisons derived from the very same training set, emphasizing the need of properly accounting for the true multi-body nature of real-world systems whenever such an information is available.

physics.soc-ph

Parallel Algorithms for Median Consensus Clustering in Complex Networks

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 greedy optimization technique. Unlike other approaches that find median set partitions, our algorithm takes graph structure into account and finds a comparable quality solution much faster than the other approaches. For graphs with known communities, our consensus partition captures the actual community structure more accurately than alternative approaches. To make it applicable to large graphs, we remove sequential dependencies from our algorithm and design a parallel algorithm. Our parallel algorithm achieves 35x speedup when utilizing 64 processing cores for large real-world graphs from single-cell experiments.

cs.IR

Shortest-path percolation on random networks

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 demanded origin-destination nodes are removed if below a certain budget. As pairs of nodes are demanded and edges are removed, the macroscopic connected component of the graph disappears, i.e., the graph undergoes a percolation transition. Here, we study such a shortest-path-percolation transition in homogeneous random graphs where pairs of demanded origin-destination nodes are randomly generated, and fully characterize it by means of finite-size scaling analysis. If budget is finite, the transition is identical to the one of ordinary percolation, where a single giant cluster shrinks as edges are removed from the graph; for infinite budget, the transition becomes more abrupt than the one of ordinary percolation, being characterized by the sudden fragmentation of the giant connected component into a multitude of clusters of similar size.

physics.soc-ph