Topics In Social Computing (67810) Module 2 (Dynamics) Cascades, Memes, and Epidemics (Networks Crowds & Markets Ch. 21)

Slides:



Advertisements
Similar presentations
The role of compatibility in the diffusion of technologies in social networks Mohammad Mahdian Yahoo! Research Joint work with N. Immorlica, J. Kleinberg,
Advertisements

Propagation in Networks
Complex Networks Advanced Computer Networks: Part1.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
COMP 621U Week 3 Social Influence and Information Diffusion
School of Information University of Michigan Network resilience Lecture 20.
Information Networks Failures and Epidemics in Networks Lecture 12.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Efficient Control of Epidemics over Random Networks Marc Lelarge (INRIA-ENS) SIGMETRICS 09.
What did we see in the last lecture?. What are we going to talk about today? Generative models for graphs with power-law degree distribution Generative.
Based on “Cascading Behavior in Networks: Algorithmic and Economic Issues” in Algorithmic Game Theory (Jon Kleinberg, 2007) and Ch.16 and 19 of Networks,
The Small World Phenomenon Abhijit Mahabal. The Kevin Bacon Game
Classical SIR and Network Models 2012 TCM Conference January 27, 2012 Dan Teague NC School of Science and Mathematics.
RD processes on heterogeneous metapopulations: Continuous-time formulation and simulations wANPE08 – December 15-17, Udine Joan Saldaña Universitat de.
On the Spread of Viruses on the Internet Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
University of Buffalo The State University of New York Spatiotemporal Data Mining on Networks Taehyong Kim Computer Science and Engineering State University.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Presentation Topic : Modeling Human Vaccinating Behaviors On a Disease Diffusion Network PhD Student : Shang XIA Supervisor : Prof. Jiming LIU Department.
Networks FIAS Summer School 6th August 2008 Complex Networks 1.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Preventing Smallpox Epidemics Using a Computational Model By Chintan Hossain and Hiren Patel.
 Fundamental terms  Diseases vs. Diseases transmitted by a network  Branching Process  The SIR epidemic model  The SIS epidemic Model  5 Worst Computer.
INTERNET THREATS AND HOW TO PROTECT YOUR COMPUTER -BRIAN ARENDT.
A Measurement-driven Analysis of Information Propagation in the Flickr Social Network WWW09 报告人: 徐波.
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
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.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Online Social Networks and Media Epidemics and Influence.
Viruses.
Human Travel Patterns Albert-László Barabási Center for Complex Networks Research, Northeastern U. Department of Medicine, Harvard U. BarabasiLab.com.
Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
V5 Epidemics on networks
Lectures 6 & 7 Centrality Measures Lectures 6 & 7 Centrality Measures February 2, 2009 Monojit Choudhury
Murtaza Abbas Asad Ali. NETWORKOLOGY THE SCIENCE OF NETWORKS.
 Propagation in Networks. Network Structure and Propagation  Diseases, fads, rumors, viral social media content all spread the same way in networks.
CPS 270: Artificial Intelligence Machine learning Instructor: Vincent Conitzer.
E PIDEMIC SPREADING Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen 1.
Professor Yashar Ganjali Department of Computer Science University of Toronto
L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Online Social Networks and Media
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
I NFORMATION C ASCADE Priyanka Garg. OUTLINE Information Propagation Virus Propagation Model How to model infection? Inferring Latent Social Networks.
 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.
Class 21: Spreading Phenomena PartI
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
1 Lecture 16 Epidemics University of Nevada – Reno Computer Science & Engineering Department Fall 2015 CS 791 Special Topics: Network Architectures and.
Introduction: Introduction: As technology advances, we have cheaper and easier ways to stay connected to the world around us. We are able to order almost.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.
Epidemic spreading on preferred degree adaptive networks Shivakumar Jolad, Wenjia Liu, R. K. P. Zia and Beate Schmittmann Department of Physics, Virginia.
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Epidemic Profiles and Defense of Scale-Free Networks L. Briesemeister, P. Lincoln, P. Porras Presented by Meltem Yıldırım CmpE
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Topics In Social Computing (67810)
What Stops Social Epidemics?
Brian Lafferty Virus on a Network.
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Peer-to-Peer and Social Networks Fall 2017
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Diffusion in Networks Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale 1/17/2019.
Navigation and Propagation in Networks
What did we see in the last lecture?
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Topics In Social Computing (67810) Module 2 (Dynamics) Cascades, Memes, and Epidemics (Networks Crowds & Markets Ch. 21)

EPIDEMIC MODELS 2

Reminder Last time we spoke about the adoption of technologies in networks Was largely driven by the utility gained from a new technology. Each social contact that adopted made adoption more worthwhile. – This is called The Network Effect – Adoption by an agent affects the utility of others: Economists refer to this as an Externality 3

Probabilistic Contagion Some things (like viruses) can be contagious even from a single interaction with someone infected, and do not require a threshold to be crossed. The most basic model: Given an infected node, each of its neighbors is infected with probability p. For simplicity, assume that each edge is only used once and that we randomize i.i.d for different edges. 4

The Basic Reproductive Number 5

The Infection Process 6

An alternative view 7 Remove each edge with probability p (i.i.d). What is the size of the connected component of the root?

The Basic Reproductive Number 8

The Expected Number of Infected Individuals 9

10

11

12 Proving part 2 of the Theorem: When does the epidemic survive to level n+1? – The root infect a child with prob. p – This child (which is the root of an identical subtree) has an epidemic that survives n levels or more. p

13 Specific child is infected & epidemic spreads n levels more All d children fail (independently) Not all d children fail

14

15

16

Discussion In graphs that aren’t regular trees, the analysis we did is not correct. The main change: collisions (i.e., several paths that reach some nodes). Still, the basic reproductive number is useful in models such as G(n,p), small world graphs, and some random scale free network models – Similar results also apply there due to lack of collisions in early stages of the process 17

Source: Wikipedia. 18

SI model Nodes can be Suceptible or Infected. Infected nodes can continue to infect for their entire lifetime and never recover. Everyone is infected eventually. But how fast? Can you think of an example that would fit this model? (Computer malware, Rumors, “Friendly” Bacteria) 19

The Continuous Case 20

SIR Model A general model for the spread of an epidemic on a graph: Nodes can be in one of 3 states Susceptible Infected Removed ( /Recovered ) Once nodes are removed they never get infected again. Best suited for a disease contracted only once in a lifetime. 21

SIR Model – Continuous ver. 22 *Courtesy of Lev Muchnik

Example 23 *Courtesy of Lev Muchnik

SIR – A Discrete-Time Network Model 24

SIR - Network Model 25

SIR - Network Model 26

SIR - Network Model 27

SIR - Network Model 28

SIR - Network Model 29

SIR - Network Model 30 Some nodes never got infected.

SIS model 31

Example Ongoing study from 1948 examines individuals in 3 year intervals. Each person is classified as content/not content/ neutral (using questionaire) 32 Hill, A. L., Rand, D. G., Nowak, M. A., & Christakis, N. A. (2010). Emotions as infectious diseases in a large social network: the SISa model. Proceedings of the Royal Society B: Biological Sciences, 277(1701),

33 Hill, A. L., Rand, D. G., Nowak, M. A., & Christakis, N. A. (2010). Emotions as infectious diseases in a large social network: the SISa model. Proceedings of the Royal Society B: Biological Sciences, 277(1701),

Model: A variant of the the SIS model: A neutral person is susceptible. Becomes infected either spontaneously (Automatically) with no contacts or through infection by a social contact Two forms of infection: Becoming content or dis-content. 34 Hill, A. L., Rand, D. G., Nowak, M. A., & Christakis, N. A. (2010). Emotions as infectious diseases in a large social network: the SISa model. Proceedings of the Royal Society B: Biological Sciences, 277(1701),

35 Hill, A. L., Rand, D. G., Nowak, M. A., & Christakis, N. A. (2010). Emotions as infectious diseases in a large social network: the SISa model. Proceedings of the Royal Society B: Biological Sciences, 277(1701),

To establish the social network structure: Social ties on each individual included: – Family – (Self nominated) friends – Neighbors – Co-Workers 36

37 Hill, A. L., Rand, D. G., Nowak, M. A., & Christakis, N. A. (2010). Emotions as infectious diseases in a large social network: the SISa model. Proceedings of the Royal Society B: Biological Sciences, 277(1701),

Fitting parameters to the data: 38 Spontaneously becoming content Infected by a contact Becoming Neutral Again Spontaneously becoming discontent Infected by a contact Becoming Neutral Again Hill, A. L., Rand, D. G., Nowak, M. A., & Christakis, N. A. (2010). Emotions as infectious diseases in a large social network: the SISa model. Proceedings of the Royal Society B: Biological Sciences, 277(1701),

Questions about the work Tie strength un-accounted for Is there selection bias? Do people tend to be friends with individuals that are prone to become more (dis-)content? 39

A Question 40

Scale Free models Reminder: In scale free networks some nodes have extremely high degree distributions This has two effects: 1.High degree nodes get infected more often than other nodes (more incoming links for infection to travel on). 2.If high-degree nodes get infected they infect many others. (reminder: item 1. is the friendship paradox at work – it is most likely that the friends of a uniformly selected node have more friends than the node itself) 41

Scale Free models 42 *Pastor-Satorras, Romualdo, and Alessandro Vespignani. "Epidemic spreading in scale-free networks." Physical review letters (2001):

This effect initially observed with regards to computer viruses, that persisted far longer than would be expected (via analysis of messages on a virus alert bulletin board) 43 *Pastor-Satorras, Romualdo, and Alessandro Vespignani. "Epidemic spreading in scale-free networks." Physical review letters (2001):

Immunization 44 Dezső, Zoltán, and Albert-László Barabási. "Halting viruses in scale-free networks." Physical Review E 65.5 (2002):

A Question 45

Answer Yes. Below: d=5 What should the infection prob. be to get an epidemic? What about an SIS process on this graph? 46

Infection in Kleinberg’s Small World Model Consider an n-by-n grid of nodes. How quickly does an infection travel on the grid? What if we added uniformly distributed long- distance outgoing links? What do you think happens in the threshold infection model? 47

SmartPhone Viruses Ways for viruses to spread BlueTooth Apps Connection to a PC MMS attachments Web and other files being sent ( , etc.) Malware on your smartphone can potentially: Have access to credit cards (app store purchases) Can call and text See your contacts and spread further through them. (anything else PC malware can do – e.g. identity theft) Very few phones have anti-virus software. 48

(pre smartphone era analysis but still highly relevant) 49 Wang, P., González, M. C., Hidalgo, C. A., & Barabási, A. L. (2009). Understanding the spreading patterns of mobile phone viruses. Science, 324(5930),

Basic Prediction: Cell phone (smartphone) viruses will be more common when market share grows. 50 Wang, P., González, M. C., Hidalgo, C. A., & Barabási, A. L. (2009). Understanding the spreading patterns of mobile phone viruses. Science, 324(5930),

Market share.01 vs.15 Blue tooth eventually reaches all users via spatial infection, but is relatively slow MMS spreads to connected component of the fragmented network almost immediately but stops there Hybrid virus enjoys best of both worlds 51

52 Wang, P., González, M. C., Hidalgo, C. A., & Barabási, A. L. (2009). Understanding the spreading patterns of mobile phone viruses. Science, 324(5930),