1 Epidemics in Social Networks Q1: How to model epidemics? Q2: How to immunize a social network? Q3: Who are the most influential spreaders?` University.

Slides:



Advertisements
Similar presentations
Modelling the impact of male circumcision on HIV/AIDS in sub-Saharan Africa Brian Williams, SACEMA 14 November 2007.
Advertisements

Probability in Propagation
Sexual Networks in Contemporary Western Societies Fredrik Liljeros Karolinska institutet Stockholm University (Supported by the Swedish Institute for Public.
1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.
Complex Networks Advanced Computer Networks: Part1.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Scale Free Networks.
School of Information University of Michigan Network resilience Lecture 20.
Daniel ben -AvrahamClarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.
RD processes on heterogeneous metapopulations: Continuous-time formulation and simulations wANPE08 – December 15-17, Udine Joan Saldaña Universitat de.
Population dynamics of infectious diseases Arjan Stegeman.
University of Buffalo The State University of New York Spatiotemporal Data Mining on Networks Taehyong Kim Computer Science and Engineering State University.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Cascading Behavior in Large Blog Graphs Patterns and a Model Leskovec et al. (SDM 2007)
Degree correlations in complex networks Lazaros K. Gallos Chaoming Song Hernan A. Makse Levich Institute, City College of New York.
Zhenhua Wu Advisor: H. E. StanleyBoston University Co-advisor: Lidia A. BraunsteinUniversidad Nacional de Mar del Plata Collaborators: Shlomo HavlinBar-Ilan.
Spreading dynamics on small-world networks with a power law degree distribution Alexei Vazquez The Simons Center for Systems Biology Institute for Advanced.
Finding the best immunization strategy Yiping Chen Collaborators: Shlomo Havlin Gerald Paul Advisor: H.Eugene Stanley.
Physical Mechanism Underlying Opinion Spreading
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
1 The epidemic in a closed population Department of Mathematical Sciences The University of Liverpool U.K. Roger G. Bowers.
Transport Properties of Fractal and Non-Fractal Scale-Free Networks
The structure of the Internet. The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet.
Epidemic spreading in complex networks: from populations to the Internet Maziar Nekovee, BT Research Y. Moreno, A. Paceco (U. Zaragoza) A. Vespignani (LPT-
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
1 Worm Modeling and Defense Cliff C. Zou, Don Towsley, Weibo Gong Univ. Massachusetts, Amherst.
Online Social Networks and Media Epidemics and Influence.
Epidemiology modeling with Stella CSCI Stochastic vs. deterministic  Suppose there are 1000 individuals and each one has a 30% chance of being.
Complex networks A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, Orsay, France) M. Barthélemy (CEA, France) L. Dall’Asta (LPT, Orsay,
Are global epidemics predictable ? V. Colizza School of Informatics, Indiana University, USA M. Barthélemy School of Informatics, Indiana University, USA.
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
V5 Epidemics on networks
Epidemic dynamics on networks Kieran Sharkey University of Liverpool NeST workshop, June 2014.
MEDUSA – New Model of Internet Topology Using k-shell Decomposition Shai Carmi Shlomo Havlin Bloomington 05/24/2005.
 Propagation in Networks. Network Structure and Propagation  Diseases, fads, rumors, viral social media content all spread the same way in networks.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Showcase /06/2005 Towards Computational Epidemiology Using Stochastic Cellular Automata in Modeling Spread of Diseases Sangeeta Venkatachalam, Armin.
E PIDEMIC SPREADING Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen 1.
Mathematical Modeling of Bird Flu Propagation Urmi Ghosh-Dastidar New York City College of Technology City University of New York December 1, 2007.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Network theory 101 Temporal effects What we are interested in What kind of relevant temporal /topological structures are there? Why? How does.
RPI (2009) To: The Rensselaer Community From: Leslie Lawrence, M.D. Medical Director, Student Health Center Date: November 23, 2009 Re: H1N1 Update.
Diseases Unit 3. Disease Outbreak  A disease outbreak happens when a disease occurs in greater numbers than expected in a community, region or during.
Complex Network Theory – An Introduction Niloy Ganguly.
Robustness and Structure of Complex Networks Shuai Shao Boston University, Physics Department A dvisor: Prof. Gene Stanley Co-advisor: Prof. Shlomo Havlin.
Complex Network Theory – An Introduction Niloy Ganguly.
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
1 Epidemic Potential in Human Sexual Networks: Connectivity and The Development of STD Cores.
Network resilience.
Class 21: Spreading Phenomena PartI
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
1 Lecture 16 Epidemics University of Nevada – Reno Computer Science & Engineering Department Fall 2015 CS 791 Special Topics: Network Architectures and.
An Improved Acquaintance Immunization Strategy for Complex Network.
Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University
Fractal Networks: Structures, Modeling, and Dynamics 章 忠 志 复旦大学计算机科学技术学院 Homepage:
Topics In Social Computing (67810) Module 2 (Dynamics) Cascades, Memes, and Epidemics (Networks Crowds & Markets Ch. 21)
Daniel ben - Avraham Clarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.
Yu Wang1, Gao Cong2, Guojie Song1, Kunqing Xie1
Cohesive Subgraph Computation over Large Graphs
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Groups of vertices and Core-periphery structure
Through University Faculty
Diseases Unit 3.
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Diseases Unit 3.
Susceptible, Infected, Recovered: the SIR Model of an Epidemic
Navigation and Propagation in Networks
Presentation transcript:

1 Epidemics in Social Networks Q1: How to model epidemics? Q2: How to immunize a social network? Q3: Who are the most influential spreaders?` University of Nevada, Reno December 2 nd, 2010 Maksim Kitsak Cooperative Association for Internet Data Analysis (CAIDA) University of California, San Diego

430 B.C. tim e Plague of Athens 25% population Cholera (7 outbreaks) ~38 million died Spanish Flu million died 2003 S.A.R.S. 775 deaths 2009H1N1 (Swine) Flu deaths Plague ~ million died

Other examples of epidemics Rumor. Ideas VirusMMS Virus

How can we model epidemics? Compartmental models! β S Susceptible I Infected μ R Recovered (immune) S Susceptible β βμ I Infected Assumption: Random Homogeneous Mixing!

How can we model epidemics? Compartmental models! Everyone Infected Endemic (equilibrium) Recovery rate = infectious rate Everyone Recovers Critical threshold: β c =μ/ β βcβc Disease extinctDisease prevails Compartmental models surprisingly well reproduce highly contagious diseases.

Human sexual contacts Nodes: people (Females; Males) Links: sexual relationships Liljeros et al. Nature Swedes; 18-74; 59% response rate.

Worldwide Airport Network 3100 airports flights 99% worldwide traffic # flights per airport Frequency passenger flow Colizza et al. PNAS 2005

Mobile Phone Contact Network Wang et al. Science 2009 Frequency Contacts per user (1 month) 6.8 million users 1 month observation

Random vs. scale-free networks (a) Erdös Rényi Poisson distribution (Exponential tail) Power-law distribution (b) Scale-Free Social networks are scale-free! Need stochastic epidemic models.

Transmission rate: Recovery rate: Quantities of interest: Total Recovered: M=14 Survivors: S=3 Total time: T=5 μ I Infected R Recovered S Susceptible β

Epidemics in scale-free networks Power-law distribution No epidemic threshold in Scale-free networks! Epidemic threshold: Anderson, May (1991) β/μ Infected fraction SF, λ=2.1, =10 Random, =10 β c =0

Network Immunization Strategies Goal of efficient immunization strategy: Immunize at least critical fraction f c of nodes so that only isolated clusters of susceptible individuals remain. If possible, without detailed knowledge of the network. f=1 fcfc Large global cluster of susceptible individuals Small (local) clusters of susceptible individuals f=0

Network Immunization Strategies Random:Targeted:Acquaintance: Required fraction Random: High threshold, no topology knowledge required. Targeted: Low threshold, knowledge of Connected nodes required. Acquaintance: Low threshold, no topology knowledge required. R. Cohen et al, Phys. Rev. Lett. (2003)

Graph Partitioning Immunization Strategy Partition network into arbitrary number of same size clusters Based on the Nested Dissection Algorithm R.J. Lipton, SIAM J. Numer. Anal.(1979) 5% to 50% fewer immunization doses required Y. Chen et al, Phys. Rev. Lett. (2008) Largest cluster Fraction immunized Targeted Nested Dissection

Who are the most influential spreaders? M. Kitsak et al. Nature Physics 2010 Not necessarily the most connected people! Not the most central people!

Spreading efficiency determined by node placement! A node A k=96 B node B k=96 Probability to be infected Hospital Network: Inpatients in the same quarters connected with links Fraction of Infected Inpatients Probability

K-core: sub-graph with nodes of degree at least k inside the sub-graph. k-cores and k-shells determine node placement Pruning Rule: 1)Remove all nodes with k=1. Some remaining nodes may now have k = 1. 2) Repeat until there is no nodes with k = 1. 3) The remaining network forms the 2-core. 4) Repeat the process for higher k to extract other cores K-shell is a set of nodes that belongs to the K-core but NOT to the K+1-core S. B. Seidman, Social Networks, 5, 269 (1983).

Identifying efficient spreaders in the hospital network (SIR) B. B. For fixed k-shell is independent of k. (1) For every individual i measure the average fraction of individuals M i he or she would infect (spreading efficiency). (2) Group individuals based on the number of connections and the k-shell value. Three candidates: Degree, k-shell, betweenness centrality Degree k-shell M A. A. Most efficient spreaders occupy high k-shells. C. C. A lot of hubs are inefficient spreaders.

Imprecision functions test the merits of degree, k-shell and centrality For given percentage p Find Np the most efficient spreaders (as measured by M) Calculate the average infected mass M EFF. Find Np the nodes with highest k-shell indices. Calculate the average infected mass M kshell. k-shell is the most robust spreading efficiency indicatior. (followed by degree and betweenness centrality) Imprecision function: Percentage Imprecision k-shell degree betweenness centrality Measure the imprecision for K-shell, degree and centrality.

Multiple Source Spreading Multiple source spreading is enhanced when one repels sources. What happens if virus starts from several origins simultaneously?

Identifying efficient spreaders in the hospital network (SIS) SIS: Number of infected nodes reaches endemic state (equilibrium) Persistence ρ i (t) (probability node i is infected at time t) High k-shells form a reservoir where virus can exist locally. Degree k-shell Consistent with core groups (H. Hethcote et al 1984)

Take home messages No epidemic threshold in Scale-free networks! 1) (Almost) No epidemic threshold in Scale-free networks! 2) Efficient immunization strategy: Immunize at least critical fraction f c of nodes so that only isolated clusters of susceptible individuals remain 3) Immunization strategy is not reciprocal to spreading strategy! 4) Influential spreaders (not necessarily hubs) occupy the innermost k-cores.

Collaborators Lazaros K. Gallos CCNY, New York, NY Lev Muchnik NYU, New York, NY Shlomo Havlin Bar-Ilan University Israel Fredrik Liljeros Stockholm University Sweden H. Eugene Stanley Boston University, Boston, MA Hernán A. Makse CCNY, New York, NY