Controlling contagion processes in activity driven networks

The vast majority of strategies aimed at controlling contagion processes on networks consider the connectivity pattern of the system either quenched or annealed. However, in the real world, many networks are highly dynamical and evolve, in time, concurrently with the contagion process. Here, we derive an analytical framework for the study of control strategies specifically devised for a class of time-varying networks, namely activity-driven networks. We develop a block variable mean-field approach that allows the derivation of the equations describing the coevolution of the contagion process and the network dynamic. We derive the critical immunization threshold and assess the effectiveness of three different control strategies. Finally, we validate the theoretical picture by simulating numerically the spreading process and control strategies in both synthetic networks and a large-scale, real-world, mobile telephone call data set

Contagion processes on the static and activity driven coupling networks

The evolution of network structure and the spreading of epidemic are common coexistent dynamical processes. In most cases, network structure is treated either static or time-varying, supposing the whole network is observed in a same time window. In this paper, we consider the epidemic spreading on a network consisting of both static and time-varying structures. At meanwhile, the time-varying part and the epidemic spreading are supposed to be of the same time scale. We introduce a static and activity driven coupling (SADC) network model to characterize the coupling between static (strong) structure and dynamic (weak) structure. Epidemic thresholds of SIS and SIR model are studied on SADC both analytically and numerically with various coupling strategies, where the strong structure is of homogeneous or heterogeneous degree distribution. Theoretical thresholds obtained from SADC model can both recover and generalize the classical results in static and time-varying networks. It is demonstrated that weak structures can make the epidemics break out much more easily in homogeneous coupling but harder in heterogeneous coupling when keeping same average degree in SADC networks. Furthermore, we show there exists a threshold ratio of the weak structure to have substantive effects on the breakout of the epidemics. This promotes our understanding of why epidemics can still break out in some social networks even we restrict the flow of the population

Epidemic Threshold in Continuous-Time Evolving Networks

Current understanding of the critical outbreak condition on temporal networks relies on approximations (time scale separation, discretization) that may bias the results. We propose a theoretical framework to compute the epidemic threshold in continuous time through the infection propagator approach. We introduce the {\em weak commutation} condition allowing the interpretation of annealed networks, activity-driven networks, and time scale separation into one formalism. Our work provides a coherent connection between discrete and continuous time representations applicable to realistic scenarios.Comment: 13 pages, 2 figure

Effects of Time Horizons on Influence Maximization in the Voter Dynamics

In this paper we analyze influence maximization in the voter model with an active strategic and a passive influencing party in non-stationary settings. We thus explore the dependence of optimal influence allocation on the time horizons of the strategic influencer. We find that on undirected heterogeneous networks, for short time horizons, influence is maximized when targeting low-degree nodes, while for long time horizons influence maximization is achieved when controlling hub nodes. Furthermore, we show that for short and intermediate time scales influence maximization can exploit knowledge of (transient) opinion configurations. More in detail, we find two rules. First, nodes with states differing from the strategic influencer's goal should be targeted. Second, if only few nodes are initially aligned with the strategic influencer, nodes subject to opposing influence should be avoided, but when many nodes are aligned, an optimal influencer should shadow opposing influence.Comment: 22 page

Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling.Comment: Minor changes and updates to reference

Evolution of controllability in interbank networks

The Statistical Physics of Complex Networks has recently provided new theoretical tools for policy makers. Here we extend the notion of network controllability to detect the financial institutions, i.e. the drivers, that are most crucial to the functioning of an interbank market. The system we investigate is a paradigmatic case study for complex networks since it undergoes dramatic structural changes over time and links among nodes can be observed at several time scales. We find a scale-free decay of the fraction of drivers with increasing time resolution, implying that policies have to be adjusted to the time scales in order to be effective. Moreover, drivers are often not the most highly connected “hub” institutions, nor the largest lenders, contrary to the results of other studies. Our findings contribute quantitative indicators which can support regulators in developing more effective supervision and intervention policies

Homophily and Contagion Are Generically Confounded in Observational Social Network Studies

We consider processes on social networks that can potentially involve three factors: homophily, or the formation of social ties due to matching individual traits; social contagion, also known as social influence; and the causal effect of an individual's covariates on their behavior or other measurable responses. We show that, generically, all of these are confounded with each other. Distinguishing them from one another requires strong assumptions on the parametrization of the social process or on the adequacy of the covariates used (or both). In particular we demonstrate, with simple examples, that asymmetries in regression coefficients cannot identify causal effects, and that very simple models of imitation (a form of social contagion) can produce substantial correlations between an individual's enduring traits and their choices, even when there is no intrinsic affinity between them. We also suggest some possible constructive responses to these results.Comment: 27 pages, 9 figures. V2: Revised in response to referees. V3: Ditt