Control of contagion processes on networks

We consider the propagation of a contagion process (“epidemic”) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. We provide a dynamic policy for the rapid containment of a contagion process modeled as an SIS epidemic on a bounded degree undirected graph with n nodes. We show that if the budget r of curing resources available at each time is Ω(W ), where W is the CutWidth of the graph, and also of order Ω(logn), then the expected time until the extinction of the epidemic is of order O(n/r), which is within a constant factor from optimal, as well as sublinear in the number of nodes. Furthermore, if the CutWidth increases only sublinearly with n, a sublinear expected time to extinction is possible with a sublinearly increasing budget r. In contrast, for bounded degree graphs, we provide a lower bound on the expected time to extinction under any such dynamic allocation policy, in terms of a combinatorial quantity that we call the resistance of the set of initially infected nodes, the available budget, and the number of nodes n. Specifically, we consider the case of bounded degree graphs, with the resistance growing linearly in n. We show that if the curing budget is less than a certain multiple of the resistance, then the expected time to extinction grows exponentially with n. As a corollary, if all nodes are initially infected and the CutWidth of the graph grows linearly, while the curing budget is less than a certain multiple of the CutWidth, then the expected time to extinction grows exponentially in n. The combination of these two results establishes a fairly sharp phase transition on the expected time to extinction (sublinear versus exponential) based on the relation between the CutWidth and the curing budget.

[1]  George J. Pappas,et al.  Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks , 2015, IEEE Control Systems.

[2]  John N. Tsitsiklis,et al.  A lower bound on the performance of dynamic curing policies for epidemics on graphs , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[3]  John N. Tsitsiklis,et al.  An efficient curing policy for epidemics on graphs , 2014, 53rd IEEE Conference on Decision and Control.

[4]  Asuman E. Ozdaglar,et al.  Estimating Social Network Structure and Propagation Dynamics for an Infectious Disease , 2014, SBP.

[5]  Chinwendu Enyioha,et al.  Optimal vaccine allocation to control epidemic outbreaks in arbitrary networks , 2013, 52nd IEEE Conference on Decision and Control.

[6]  Sinan Aral,et al.  Identifying Influential and Susceptible Members of Social Networks , 2012, Science.

[7]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[8]  Piet Van Mieghem,et al.  Optimization of network protection against virus spread , 2011, 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN).

[9]  Amin Saberi,et al.  How to distribute antidote to control epidemics , 2010, Random Struct. Algorithms.

[10]  Fan Chung Graham,et al.  Distributing Antidote Using PageRank Vectors , 2009, Internet Math..

[11]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[12]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[13]  Lada A. Adamic,et al.  Tracking information epidemics in blogspace , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[14]  V. Anantharam,et al.  Designing a contact process: the piecewise-homogeneous process on a finite set with applications , 2005 .

[15]  Donald F. Towsley,et al.  Modeling malware spreading dynamics , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  E. Rogers,et al.  Diffusion of innovations , 1964, Encyclopedia of Sport Management.

[17]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[18]  J. Steele.  Stochastic Calculus and Financial Applications , 2000 .

[19]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[20]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[21]  T. Liggett.  Interacting Particle Systems , 1985 .