arXiv subjects

Claudio Castellano

Publications and source records attributed to Claudio Castellano.

At least 55 records · Page 3Linked to original sources

arXiv2018

Epidemic Spreading and Aging in Temporal Networks with Memory

Time-varying network topologies can deeply influence dynamical processes mediated by them. Memory effects in the pattern of interactions among individuals are also known to affect how diffusive and spreading phenomena take place. In this paper we analyze the combined effect of these two ingredients on epidemic dynamics on networks. We study the susceptible-infected-susceptible (SIS) and the susceptible-infected-removed (SIR) models on the recently introduced activity-driven networks with memory. By means of an activity-based mean-field approach we derive, in the long time limit, analytical predictions for the epidemic threshold as a function of the parameters describing the distribution of activities and the strength of the memory effects. Our results show that memory reduces the threshold, which is the same for SIS and SIR dynamics, therefore favouring epidemic spreading. The theoretical approach perfectly agrees with numerical simulations in the long time asymptotic regime. Strong aging effects are present in the preasymptotic regime and the epidemic threshold is deeply affected by the starting time of the epidemics. We discuss in detail the origin of the model-dependent preasymptotic corrections, whose understanding could potentially allow for epidemic control on correlated temporal networks.

physics.soc-ph↗

arXiv2018

Relevance of backtracking paths in epidemic spreading on networks

The understanding of epidemics on networks has greatly benefited from the recent application of message-passing approaches, which allow to derive exact results for irreversible spreading (i.e. diseases with permanent acquired immunity) in locally-tree like topologies. This success has suggested the application of the same approach to reversible epidemics, for which an individual can contract the epidemic and recover repeatedly. The underlying assumption is that backtracking paths (i.e. an individual is reinfected by a neighbor he/she previously infected) do not play a relevant role. In this paper we show that this is not the case for reversible epidemics, since the neglect of backtracking paths leads to a formula for the epidemic threshold that is qualitatively incorrect in the large size limit. Moreover we define a modified reversible dynamics which explicitly forbids direct backtracking events and show that this modification completely upsets the phenomenology.

cond-mat.stat-mech↗

arXiv2018

Uncertainty Reduction for Stochastic Processes on Complex Networks

Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules, the ability to predict system configurations is generally characterized by a large uncertainty. Selecting a fraction of the nodes and observing their state may help to reduce the uncertainty about the unobserved nodes. However, choosing these points of observation in an optimal way is a highly nontrivial task, depending on the nature of the stochastic process and on the structure of the underlying interaction pattern. In this paper, we introduce a computationally efficient algorithm to determine quasioptimal solutions to the problem. The method leverages network sparsity to reduce computational complexity from exponential to almost quadratic, thus allowing the straightforward application of the method to mid-to-large-size systems. Although the method is exact only for equilibrium stochastic processes defined on trees, it turns out to be effective also for out-of-equilibrium processes on sparse loopy networks.

physics.soc-ph↗

arXiv2018

Analytical study of quality-biased competition dynamics for memes in social media

The spreading of news, memes and other pieces of information occurring via online social platforms has a strong and growing impact on our modern societies, with enormous consequences, that may be beneficial but also catastrophic. In this work we consider a recently introduced model for information diffusion in social media taking explicitly into account the competition of a large number of items of diverse quality. We map the meme dynamics onto a one-dimensional diffusion process that we solve analytically, deriving the lifetime and popularity distributions of individual memes. We also present a mean-field type of approach that reproduces the average stationary properties of the dynamics. In this way we understand and control the role of the different ingredients of the model, opening the path for the inclusion of additional, more realistic, features.

physics.soc-ph↗

arXiv2018

Rapid decay in the relative efficiency of quarantine to halt epidemics in networks

Several recent studies have tackled the issue of optimal network immunization by providing efficient criteria to identify key nodes to be removed in order to break apart a network, thus preventing the occurrence of extensive epidemic outbreaks. Yet, although the efficiency of those criteria has been demonstrated also in empirical networks, preventive immunization is rarely applied to real-world scenarios, where the usual approach is the a posteriori attempt to contain epidemic outbreaks using quarantine measures. Here we compare the efficiency of prevention with that of quarantine in terms of the tradeoff between the number of removed and saved nodes on both synthetic and empirical topologies. We show how, consistent with common sense, but contrary to common practice, in many cases preventing is better than curing: depending on network structure, rescuing an infected network by quarantine could become inefficient soon after the first infection.

physics.soc-ph↗

arXiv2018

Eigenvector localization in real networks and its implications for epidemic spreading

The spectral properties of the adjacency matrix, in particular its largest eigenvalue and the associated principal eigenvector, dominate many structural and dynamical properties of complex networks. Here we focus on the localization properties of the principal eigenvector in real networks. We show that in most cases it is either localized on the star defined by the node with largest degree (hub) and its nearest neighbors, or on the densely connected subgraph defined by the maximum $K$-core in a $K$-core decomposition. The localization of the principal eigenvector is often strongly correlated with the value of the largest eigenvalue, which is given by the local eigenvalue of the corresponding localization subgraph, but different scenarios sometimes occur. We additionally show that simple targeted immunization strategies for epidemic spreading are extremely sensitive to the actual localization set.

physics.soc-ph↗

arXiv2017

Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects

The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically grounded expression relating the value of the largest eigenvalue of a given network to the largest eigenvalue of two network subgraphs, considered as isolated: The hub with its immediate neighbors and the densely connected set of nodes with maximum $K$-core index. We validate this formula showing that it predicts with good accuracy the largest eigenvalue of a large set of synthetic and real-world topologies. We also present evidence of the consequences of these findings for broad classes of dynamics taking place on the networks. As a byproduct, we reveal that the spectral properties of heterogeneous networks built according to the linear preferential attachment model are qualitatively different from those of their static counterparts.

physics.soc-ph↗

arXiv2017

Mutually cooperative epidemics on power-law networks

The spread of an infectious disease can, in some cases, promote the propagation of other pathogens favouring violent outbreaks, which cause a discontinuous transition to an endemic state. The topology of the contact network plays a crucial role in these cooperative dynamics. We consider a susceptible--infected--removed (SIR) type model with two mutually cooperative pathogens: an individual already infected with one disease has an increased probability of getting infected by the other. We present an heterogeneous mean-field theoretical approach to the co--infection dynamics on generic uncorrelated power-law degree-distributed networks and validate its results by means of numerical simulations. We show that, when the second moment of the degree distribution is finite, the epidemic transition is continuous for low cooperativity, while it is discontinuous when cooperativity is sufficiently high. For scale-free networks, i.e. topologies with diverging second moment, the transition is instead always continuous. In this way we clarify the effect of heterogeneity and system size on the nature of the transition and we validate the physical interpretation about the origin of the discontinuity.

physics.soc-ph↗

arXiv2017

Topological structure and the H-index in complex networks

The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets of nodes having the same $H(n)$, within the annealed network approximation. The connection between the Hirsch indices and the degree is highlighted. Numerical tests in synthetic uncorrelated networks and real-world correlated ones validate the findings. We also test the use of the Hirsch index for the identification of influential spreaders in networks, finding that it is in general outperformed by the recently introduced Non-Backtracking centrality.

physics.soc-ph↗

arXiv2017

Fundamental difference between superblockers and superspreaders in networks

Two very important problems regarding spreading phenomena in complex topologies are the optimal selection of node sets either to minimize or maximize the extent of outbreaks. Both problems are nontrivial when a small fraction of the nodes in the network can be used to achieve the desired goal. The minimization problem is equivalent to a structural optimization. The "superblockers", i.e., the nodes that should be removed from the network to minimize the size of outbreaks, are those nodes that make connected components as small as possible. "Superspreaders" are instead the nodes such that, if chosen as initiators, they maximize the average size of outbreaks. The identity of superspreaders is expected to depend not just on the topology, but also on the specific dynamics considered. Recently, it has been conjectured that the two optimization problems might be equivalent, in the sense that superblockers act also as superspreaders. In spite of its potential groundbreaking importance, no empirical study has been performed to validate this conjecture. In this paper, we perform an extensive analysis over a large set of real-world networks to test the similarity between sets of superblockers and of superspreaders. We show that the two optimization problems are not equivalent: superblockers do not act as optimal spreaders.

physics.soc-ph↗

arXiv2016

On the numerical study of percolation and epidemic critical properties in networks

The static properties of the fundamental model for epidemics of diseases allowing immunity (susceptible-infected-removed model) are known to be derivable by an exact mapping to bond percolation. Yet when performing numerical simulations of these dynamics in a network a number of subtleties must be taken into account in order to correctly estimate the transition point and the associated critical properties. We expose these subtleties and identify the different quantities which play the role of criticality detector in the two dynamics.

physics.soc-ph↗

arXiv2016

Breaking of the site-bond percolation universality in networks

The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system. Percolation has always been regarded as a substrate-dependent but model-independent process, in the sense that the critical exponents of the transition are determined by the geometry of the system, but they are identical for the bond and site percolation models. Here, we report a violation of such assumption. We provide analytical and numerical evidence of a difference in the values of the critical exponents between the bond and site percolation models in networks with null percolation thresholds, such as scale-free graphs with diverging second moment of the degree distribution. We discuss possible implications of our results in real networks, and provide additional insights on the anomalous nature of the percolation transition with null threshold.

physics.soc-ph↗

arXiv2016

Leveraging percolation theory to single out influential spreaders in networks

Among the consequences of the disordered interaction topology underlying many social, techno- logical and biological systems, a particularly important one is that some nodes, just because of their position in the network, may have a disproportionate effect on dynamical processes mediated by the complex interaction pattern. For example, the early adoption by an opinion leader in a social network may change the fate of a commercial product, or just a few super-spreaders may determine the virality of a meme in social media. Despite many recent efforts, the formulation of an accurate method to optimally identify influential nodes in complex network topologies remains an unsolved challenge. Here, we present the exact solution of the problem for the specific, but highly relevant, case of the Susceptible-Infected-Removed (SIR) model for epidemic spreading at criticality. By exploiting the mapping between bond percolation and the static properties of SIR, we prove that the recently introduced Non-Backtracking centrality is the optimal criterion for the identification of influential spreaders in locally tree-like networks at criticality. By means of simulations on synthetic networks and on a very extensive set of real-world networks, we show that the Non-Backtracking centrality is a highly reliable metric to identify top influential spreaders also in generic graphs not embedded in space, and for noncritical spreading.

physics.soc-ph↗

arXiv2016

Consensus versus persistence of disagreement in opinion formation: the role of zealots

We consider a general class of three--state models where individuals hold one of two opposite opinions, or are neutral, and exchange opinions in generic pairwise interactions. We show that when opinions spread in a population where a fraction of individuals (zealots) maintain unshakably their opinion, one of four qualitatively distinct kinds of collective dynamics arise, depending on the specific rules governing the social interactions. Unsurprisingly, when their density is high, zealots drive the whole population to consensus on their opinion. For low densities a rich phase diagram emerges: a finite population of dissenters can survive and be the only stationary state or may need a critical mass or dissenters to be sustained; the critical mass may vanish or not as the density is reduced; the transition to the high density regime can be smooth or abrupt, and shows interesting hysteretic effects. For each choice of the interaction rules we calculate the critical density of zealots above which diverse opinions cannot survive.

physics.soc-ph↗

arXiv2016

Beyond the locally tree-like approximation for percolation on real networks

Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often characterized by high frequencies of short loops. We present here a theoretical framework able to overcome such a limitation for the case of site percolation. Our method is based on a message passing algorithm that discounts redundant paths along triangles in the graph. We systematically test the approach on 98 real-world graphs and on synthetic networks. We find excellent accuracy in the prediction of the whole percolation diagram, with significant improvement with respect to the prediction obtained under the locally tree-like approximation. Residual discrepancies between theory and simulations do not depend on clustering and can be attributed to the presence of loops longer than three edges. We present also a method to account for clustering in bond percolation, but the improvement with respect to the method based on the tree-like approximation is much less apparent.

physics.soc-ph↗

arXiv2016

Distinct types of eigenvector localization in networks

The spectral properties of the adjacency matrix provide a trove of information about the structure and function of complex networks. In particular, the largest eigenvalue and its associated principal eigenvector are crucial in the understanding of nodes centrality and the unfolding of dynamical processes. Here we show that two distinct types of localization of the principal eigenvector may occur in heterogeneous networks. For synthetic networks with degree distribution $P(q) \sim q^{-γ}$, localization occurs on the largest hub if $γ>5/2$; for $γ<5/2$ a new type of localization arises on a mesoscopic subgraph associated with the shell with the largest index in the $K$-core decomposition. Similar evidence for the existence of distinct localization modes is found in the analysis of real-world networks. Our results open a new perspective on dynamical processes on networks and on a recently proposed alternative measure of node centrality based on the non-backtracking matrix.

physics.soc-ph↗

arXiv2015

Interplay between media and social influence in the collective behavior of opinion dynamics

Messages conveyed by media act as a major drive in shaping attitudes and inducing opinion shift. On the other hand, individuals are strongly affected by peer pressure while forming their own judgment. We solve a general model of opinion dynamics where individuals either hold one of two alternative opinions or are undecided and interact pairwise while exposed to an external influence. As media pressure increases, the system moves from pluralism to global consensus; four distinct classes of collective behavior emerge, crucially depending on the outcome of direct interactions among individuals holding opposite opinions. Observed nontrivial behaviors include hysteretic phenomena and resilience of minority opinions. Notably, consensus could be unachievable even when media and microscopic interactions are biased in favor of the same opinion: The unfavored opinion might even gain the support of the majority.

physics.soc-ph↗

arXiv2015

Epidemic processes in complex networks

In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems. The complex properties of real-world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks. The theoretical analysis of epidemic spreading in heterogeneous networks requires the development of novel analytical frameworks, and it has produced results of conceptual and practical relevance. A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear. Physicists, mathematicians, epidemiologists, computer, and social scientists share a common interest in studying epidemic spreading and rely on similar models for the description of the diffusion of pathogens, knowledge, and innovation. For this reason, while focusing on the main results and the paradigmatic models in infectious disease modeling, the major results concerning generalized social contagion processes are also presented. Finally, the research activity at the forefront in the study of epidemic spreading in coevolving, coupled, and time-varying networks is reported.

physics.soc-ph↗