arXiv subjects

Claudio Castellano

Publications and source records attributed to Claudio Castellano.

At least 37 records · Page 2Linked to original sources

arXiv2022

Sideward contact tracing and the control of epidemics in large gatherings

Effective contact tracing is crucial to contain epidemic spreading without disrupting societal activities especially in the present time of coexistence with a pandemic outbreak. Large gatherings play a key role, potentially favouring superspreading events. However, the effects of tracing in large groups have not been fully assessed so far. We show that beside forward tracing, which reconstructs to whom disease spreads, and backward tracing, which searches from whom disease spreads, a third "sideward" tracing is always present, when tracing gatherings. This is an indirect tracing that detects infected asymptomatic individuals, even if they have neither been directly infected by, nor they have directly transmitted the infection to the index case. We analyse this effect in a model of epidemic spreading for SARS-CoV-2, within the framework of simplicial activity-driven temporal networks. We determine the contribution of the three tracing mechanisms to the suppression of epidemic spreading, showing that sideward tracing induces a non-monotonic behaviour in the tracing efficiency, as a function of the size of the gatherings. Based on our results, we suggest an optimal choice for the sizes of the gatherings to be traced and we test the strategy on an empirical dataset of gatherings in a University Campus.

physics.soc-ph↗

arXiv2022

Filter Bubble effect in the multistate voter model

Social media influence online activity by recommending to users content strongly correlated with what they have preferred in the past. In this way they constrain users within filter bubbles that strongly limit their exposure to new or alternative content. We investigate this type of dynamics by considering a multistate voter model where, with a given probability $λ$, a user interacts with a "personalized information" suggesting the opinion most frequently held in the past. By means of theoretical arguments and numerical simulations, we show the existence of a nontrivial transition between a region (for small $λ$) where consensus is reached and a region (above a threshold $λ_c$) where the system gets polarized and clusters of users with different opinions persist indefinitely. The threshold always vanishes for large system size $N$, showing that consensus becomes impossible for a large number of users. This finding opens new questions about the side effects of the widespread use of personalized recommendation algorithms.

physics.soc-ph↗

arXiv2021

The effect of delayed awareness and fatigue on the efficacy of self-isolation in epidemic control

The isolation of infectious individuals is a key measure of public health for the control of communicable diseases. However, involving a strong perturbation of daily life, it often causes psychosocial distress, and severe financial and social costs. These may act as mechanisms limiting the adoption of the measure in the first place or the adherence throughout its full duration. In addition, difficulty of recognizing mild symptoms or lack of symptoms may impact awareness of the infection and further limit adoption. Here, we study an epidemic model on a network of contacts accounting for limited adherence and delayed awareness to self-isolation, along with fatigue causing overhasty termination. The model allows us to estimate the role of each ingredient and analyze the tradeoff between adherence and duration of self-isolation. We find that the epidemic threshold is very sensitive to an effective compliance that combines the effects of imperfect adherence, delayed awareness and fatigue. If adherence improves for shorter quarantine periods, there exists an optimal duration of isolation, shorter than the infectious period. However, heterogeneities in the connectivity pattern, coupled to a reduced compliance for highly active individuals, may almost completely offset the effectiveness of self-isolation measures on the control of the epidemic.

physics.soc-ph↗

arXiv2021

Universality, criticality and complexity of information propagation in social media

Information avalanches in social media are typically studied in a similar fashion as avalanches of neuronal activity in the brain. Whereas a large body of literature reveals substantial agreement about the existence of a unique process characterizing neuronal activity across organisms, the dynamics of information in online social media is far less understood. Statistical laws of information avalanches are found in previous studies to be not robust across systems, and radically different processes are used to represent plausible driving mechanisms for information propagation. Here, we analyze almost 1 billion time-stamped events collected from a multitude of online platforms -- including Telegram, Twitter and Weibo -- over observation windows longer than 10 years to show that the propagation of information in social media is a universal and critical process. Universality arises from the observation of identical macroscopic patterns across platforms, irrespective of the details of the specific system at hand. Critical behavior is deduced from the power-law distributions, and corresponding hyperscaling relations, characterizing size and duration of avalanches of information. Neuronal activity may be modeled as a simple contagion process, where only a single exposure to activity may be sufficient for its diffusion. On the contrary, statistical testing on our data indicates that a mixture of simple and complex contagion, where involvement of an individual requires exposure from multiple acquaintances, characterizes the propagation of information in social media. We show that the complexity of the process is correlated with the semantic content of the information that is propagated. Conversational topics about music, movies and TV shows tend to propagate as simple contagion processes, whereas controversial discussions on political/societal themes obey the rules of complex contagion.

physics.soc-ph↗

arXiv2021

Influence of individual nodes for continuous-time Susceptible-Infected-Susceptible dynamics on synthetic and real-world networks

In the study of epidemic dynamics a fundamental question is whether a pathogen initially affecting only one individual will give rise to a limited outbreak or to a widespread pandemic. The answer to this question crucially depends not only on the parameters describing the infection and recovery processes but also on where, in the network of interactions, the infection starts from. We study the dependence on the location of the initial seed for the Susceptible-Infected-Susceptible epidemic dynamics in continuous time on networks. We first derive analytical predictions for the dependence on the initial node of three indicators of spreading influence (probability to originate an infinite outbreak, average duration and size of finite outbreaks) and compare them with numerical simulations on random uncorrelated networks, finding a very good agreement. We then show that the same theoretical approach works fairly well also on a set of real-world topologies of diverse nature. We conclude by briefly investigating which topological network features determine deviations from the theoretical predictions.

physics.soc-ph↗

arXiv2021

Stochastic sampling effects favor manual over digital contact tracing

Isolation of symptomatic individuals, tracing and testing of their nonsymptomatic contacts are fundamental strategies for mitigating the current COVID-19 pandemic. The breaking of contagion chains relies on two complementary strategies: manual reconstruction of contacts based on interviews and a digital (app-based) privacy-preserving contact tracing. We compare their effectiveness using model parameters tailored to describe SARS-CoV-2 diffusion within the activity-driven model, a general empirically validated framework for network dynamics. We show that, even for equal probability of tracing a contact, manual tracing robustly performs better than the digital protocol, also taking into account the intrinsic delay and limited scalability of the manual procedure. This result is explained in terms of the stochastic sampling occurring during the case-by-case manual reconstruction of contacts, contrasted with the intrinsically prearranged nature of digital tracing, determined by the decision to adopt the app or not by each individual. The better performance of manual tracing is enhanced by heterogeneity in agent behavior: superspreaders not adopting the app are completely invisible to digital contact tracing, while they can be easily traced manually, due to their multiple contacts. We show that this intrinsic difference makes the manual procedure dominant in realistic hybrid protocols.

physics.soc-ph↗

arXiv2021

Percolation theory of self-exciting temporal processes

We investigate how the properties of inhomogeneous patterns of activity, appearing in many natural and social phenomena, depend on the temporal resolution used to define individual bursts of activity. To this end, we consider time series of microscopic events produced by a self-exciting Hawkes process, and leverage a percolation framework to study the formation of macroscopic bursts of activity as a function of the resolution parameter. We find that the very same process may result in different distributions of avalanche size and duration, which are understood in terms of the competition between the 1D percolation and the branching process universality class. Pure regimes for the individual classes are observed at specific values of the resolution parameter corresponding to the critical points of the percolation diagram. A regime of crossover characterized by a mixture of the two universal behaviors is observed in a wide region of the diagram. The hybrid scaling appears to be a likely outcome for an analysis of the time series based on a reasonably chosen, but not precisely adjusted, value of the resolution parameter.

physics.soc-ph↗

arXiv2021

The localization of non-backtracking centrality in networks and its physical consequences

The spectrum of the non-backtracking matrix plays a crucial role in determining various structural and dynamical properties of networked systems, ranging from the threshold in bond percolation and non-recurrent epidemic processes, to community structure, to node importance. Here we calculate the largest eigenvalue of the non-backtracking matrix and the associated non-backtracking centrality for uncorrelated random networks, finding expressions in excellent agreement with numerical results. We show however that the same formulas do not work well for many real-world networks. We identify the mechanism responsible for this violation in the localization of the non-backtracking centrality on network subgraphs whose formation is highly unlikely in uncorrelated networks, but rather common in real-world structures. Exploiting this knowledge we present an heuristic generalized formula for the largest eigenvalue, which is remarkably accurate for all networks of a large empirical dataset. We show that this newly uncovered localization phenomenon allows to understand the failure of the message-passing prediction for the percolation threshold in many real-world structures.

physics.soc-ph↗

arXiv2020

Emergence of polarization in a voter model with personalized information

The flourishing of fake news is favored by recommendation algorithms of online social networks which, based on previous users activity, provide content adapted to their preferences and so create filter bubbles. We introduce an analytically tractable voter model with personalized information, in which an external field tends to align the agent opinion with the one she held more frequently in the past. Our model shows a surprisingly rich dynamics despite its simplicity. An analytical mean-field approach, confirmed by numerical simulations, allows us to build a phase diagram and to predict if and how consensus is reached. Remarkably, polarization can be avoided only for weak interaction with the personalized information and if the number of agents is below a threshold. We analytically compute this critical size, which depends on the interaction probability in a strongly non linear way.

physics.soc-ph↗

arXiv2020

Degree-Ordered-Percolation on uncorrelated networks

We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate resilience of networks under intentional attack, and has received limited attention so far. The interest in DOP is also motivated by its connection with the Susceptible-Infected-Susceptible (SIS) model for epidemic spreading, since a variation of DOP is related to the vanishing of the SIS transition for random power-law degree-distributed networks $P(k) \sim k^{-γ}$. By using the generating function formalism, we investigate the behavior of the DOP model on networks with generic value of $γ$ and we validate the analytical results by means of numerical simulations. We find that the percolation threshold vanishes in the limit of large networks for $γ\le 3$, while it is finite for $γ>3$, although its value for $γ$ between 3 and 4 is exceedingly small and preasymptotic effects are huge. We also derive the critical properties of the DOP transition, in particular how the exponents depend on the heterogeneity of the network, determining that DOP does not belong to the universality class of random percolation for $γ\le 3$.

cond-mat.stat-mech↗

arXiv2020

Classes of critical avalanche dynamics in complex networks

Dynamical processes exhibiting absorbing states are essential in the modeling of a large variety of situations from material science to epidemiology and social sciences. Such processes exhibit the possibility of avalanching behavior upon slow driving. Here, we study the distribution of sizes and durations of avalanches for well-known dynamical processes on complex networks. We find that all analyzed models display a similar critical behavior, characterized by the presence of two distinct regimes. At small scales, sizes and durations of avalanches exhibit distributions that are dependent on the network topology and the model dynamics. At asymptotically large scales instead -- irrespective of the type of dynamics and of the topology of the underlying network -- sizes and durations of avalanches are characterized by power-law distributions with the exponents of the standard mean-field critical branching process.

physics.soc-ph↗

arXiv2020

Influential spreaders for recurrent epidemics on networks

The identification of which nodes are optimal seeds for spreading processes on a network is a non-trivial problem that has attracted much interest recently. While activity has mostly focused on non-recurrent type of dynamics, here we consider the problem for the Susceptible-Infected-Susceptible (SIS) spreading model, where an outbreak seeded in one node can originate an infinite activity avalanche. We apply the theoretical framework for avalanches on networks proposed by Larremore et al. [Phys. Rev. E 85, 066131 (2012)], to obtain detailed quantitative predictions for the spreading influence of individual nodes (in terms of avalanche duration and avalanche size) both above and below the epidemic threshold. When the approach is complemented with an annealed network approximation, we obtain fully analytical expressions for the observables of interest close to the transition, highlighting the role of degree centrality. Comparison of these results with numerical simulations performed on synthetic networks with power-law degree distribution reveals in general a good agreement in the subcritical regime, leaving thus some questions open for further investigation relative to the supercritical region.

physics.soc-ph↗

arXiv2020

Competition between vaccination and disease spreading

We study the interaction between epidemic spreading and a vaccination process. We assume that, similar to the disease spreading, also the vaccination process occurs through direct contact, i.e., it follows the standard susceptible-infected-susceptible (SIS) dynamics. The two competing processes are asymmetrically coupled as vaccinated nodes can directly become infected at a reduced rate with respect to susceptible ones. We study analytically the model in the framework of mean-field theory finding a rich phase-diagram. When vaccination provides little protection toward infection, two continuous transitions separate a disease-free immunized state from vaccinated-free epidemic state, with an intermediate mixed state where susceptible, infected and vaccinated individuals coexist. As vaccine efficiency increases, a tricritical point leads to a bistable regime and discontinuous phase transitions emerge. Numerical simulations for homogeneous random networks agree very well with analytical predictions.

physics.soc-ph↗

arXiv2020

Cumulative Merging Percolation and the epidemic transition of the Susceptible-Infected-Susceptible model in networks

We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which represents a generalization of degree-ordered percolation, we derive a scaling solution on uncorrelated complex networks, unveiling the existence of diverse mechanisms leading to the formation of a percolating cluster. The scaling solution accurately reproduces universal properties of the transition. This finding is used to infer the critical properties of the Susceptible-Infected-Susceptible (SIS) model for epidemics in infinite and finite power-law distributed networks. Here discrepancies between analytical approaches and numerical results regarding the finite size scaling of the epidemic threshold are a crucial open issue in the literature. We find that the scaling exponent assumes a nontrivial value during a long preasymptotic regime. We calculate this value, finding good agreement with numerical evidence. We also show that the crossover to the true asymptotic regime occurs for sizes much beyond currently feasible simulations. Our findings allow us to rationalize and reconcile all previously published results (both analytical and numerical), thus ending a long-standing debate.

cond-mat.stat-mech↗

arXiv2020

Message-passing theory for cooperative epidemics

The interaction among spreading processes on a complex network is a nontrivial phenomenon of great importance. It has recently been realized that cooperative effects among infective diseases can give rise to qualitative changes in the phenomenology of epidemic spreading, leading for instance to abrupt transitions and hysteresis. Here we consider a simple model for two interacting pathogens on a network and we study it by using the message-passing approach. In this way we are able to provide detailed predictions for the behavior of the model in the whole phase-diagram for any given network structure. Numerical simulations on synthetic networks (both homogeneous and heterogeneous) confirm the great accuracy of the theoretical results. We finally consider the issue of identifying the nodes where it is better to seed the infection in order to maximize the probability of observing an extensive outbreak. The message-passing approach provides an accurate solution also for this problem.

physics.soc-ph↗

arXiv2019

Systematic comparison between methods for the detection of influential spreaders in complex networks

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 this problem are important for strategic decisions in marketing and political campaigns. The typical setting consists in the identification of small sets of initial spreaders in very large networks. This setting makes the optimization problem computationally infeasible for standard greedy optimization algorithms that account simultaneously for information about network topology and spreading dynamics, leaving space only to heuristic methods based on the drastic approximation of relying on the geometry of the network alone. The literature on the subject is plenty of purely topological methods for the identification of influential spreaders in networks. However, it is unclear how far these methods are from being optimal. Here, we perform a systematic test of the performance of a multitude of heuristic methods for the identification of influential spreaders. We quantify the performance of the various methods on a corpus of 100 real-world networks; the corpus consists of networks small enough for the application of greedy optimization so that results from this algorithm are used as the baseline needed for the analysis of the performance of the other methods on the same corpus of networks. We find that relatively simple network metrics, such as adaptive degree or closeness centralities, are able to achieve performances very close to the baseline value, thus providing good support for the use of these metrics in large-scale problem settings....

physics.soc-ph↗

arXiv2019

Spectral properties and the accuracy of mean-field approaches for epidemics on correlated networks

We present a comparison between stochastic simulations and mean-field theories for the epidemic threshold of the susceptible-infected-susceptible (SIS) model on correlated networks (both assortative and disassortative) with power-law degree distribution $P(k)\sim k^{-γ}$. We confirm the vanishing of the threshold regardless of the correlation pattern and the degree exponent $γ$. Thresholds determined numerically are compared with quenched mean-field (QMF) and pair quenched mean-field (PQMF) theories. Correlations do not change the overall picture: QMF and PQMF provide estimates that are asymptotically correct for large size for $γ<5/2$, while they only capture the vanishing of the threshold for $γ>5/2$, failing to reproduce quantitatively how this occurs. For a given size, PQMF is more accurate. We relate the variations in the accuracy of QMF and PQMF predictions with changes in the spectral properties (spectral gap and localization) of standard and modified adjacency matrices, which rule the epidemic prevalence near the transition point, depending on the theoretical framework. We also show that, for $γ<5/2$, while QMF provides an estimate of the epidemic threshold that is asymptotically exact, it fails to reproduce the singularity of the prevalence around the transition.

physics.soc-ph↗

arXiv2018

Effect of network clustering on mutually cooperative coinfections

The spread of an infectious disease can be promoted by previous infections with other pathogens. This cooperative effect can give rise to violent outbreaks, reflecting the presence of an abrupt epidemic transition. As for other diffusive dynamics, the topology of the interaction pattern of the host population plays a crucial role. It was conjectured that a discontinuous transition arises when there are relatively few short loops and many long loops in the contact network. Here we focus on the role of local clustering in determining the nature of the transition. We consider two mutually cooperative pathogens diffusing in the same population: an individual already infected with one disease has an increased probability of getting infected by the other. We look at how a disease obeying the susceptible-infected-removed dynamics spreads on contact networks with tunable clustering. Using numerical simulations we show that for large cooperativity the epidemic transition is always abrupt, with the discontinuity decreasing as clustering is increased. For large clustering strong finite size effects are present and the discontinuous nature of the transition is manifest only in large networks. We also investigate the problem of influential spreaders for cooperative infections, revealing that both cooperativity and clustering strongly enhance the dependence of the spreading influence on the degree of the initial seed.

physics.soc-ph↗