Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.

Slides:



Advertisements
Similar presentations
Contagion, Tipping and Networks Networked Life CSE 112 Spring 2004 Prof. Michael Kearns.
Advertisements

Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) Columbia University Joint CS/EE Networking Seminar June 2, 2011.
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
School of Information University of Michigan Network resilience Lecture 20.
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Contagion, Tipping and Navigation in Networks Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Strategic Models of Network Formation Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
“The Tipping Point” and the Networked Nature of Society Michael Kearns Computer and Information Science Penn Reading Project 2004.
Contagion, Tipping and Navigation in Networks Networked Life CSE 112 Spring 2007 Prof. Michael Kearns.
Network Science: “Universal” Structure and Models of Formation Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
Game Theory: Whirlwind Review Matrix (normal form) games, mixed strategies, Nash equil. –the basic objects of vanilla game theory –the power of private.
Experiments in Behavioral Network Science: Brief Coloring and Consensus Postmortem (Revised and Updated 4/2/07) Networked Life CSE 112 Spring 2007 Michael.
The Networked Nature of Society Networked Life CSE 112 Spring 2005 Prof. Michael Kearns.
News and Notes, 1/12 Please give your completed handout from Tue to Jenn now Reminder: Mandatory out-of-class experiments 1/24 and 1/25 –likely time: either.
Contagion and Tipping in Networks Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Agenda: Tuesday, Jan 25 Reports from the Field: –Friendster, Love and Money : Monday NY Times (Katy Keenan)Friendster, Love and Money –That’s Soooo High.
Economic Models of Network Formation Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
The Networked Nature of Society Networked Life CSE 112 Spring 2007 Prof. Michael Kearns.
Economic Models of Network Formation Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
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.
1 Worm Modeling and Defense Cliff C. Zou, Don Towsley, Weibo Gong Univ. Massachusetts, Amherst.
Business Modeling Lecturer: Ing. Martina Hanová, PhD.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Contagion, Tipping and Navigation in Networks Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns.
V5 Epidemics on networks
Some Analysis of Coloring Experiments and Intro to Competitive Contagion Assignment Prof. Michael Kearns Networked Life NETS 112 Fall 2014.
Structural Properties of Networks: Introduction Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Modeling frameworks Today, compare:Deterministic Compartmental Models (DCM) Stochastic Pairwise Models (SPM) for (I, SI, SIR, SIS) Rest of the week: Focus.
Chip-firing Game and Data Structures Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
Dynamic Random Graph Modelling and Applications in the UK 2001 Foot-and-Mouth Epidemic Christopher G. Small Joint work with Yasaman Hosseinkashi, Shoja.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.
What Is A Network? (and why do we care?). An Introduction to Network Theory | Kyle Findlay | SAMRA 2010 | 2 “A collection of objects (nodes) connected.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013.
How Do “Real” Networks Look?
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.
On the behaviour of an edge number in a power-law random graph near a critical points E. V. Feklistova, Yu.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Structural Properties of Networks: Introduction
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Pedro Ribeiro de Andrade Münster, 2013
Trading in Networks: I. Model
Structural Properties of Networks: Introduction
How Do “Real” Networks Look?
Community detection in graphs
Structural Properties of Networks: Introduction
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
How Do “Real” Networks Look?
How Do “Real” Networks Look?
Models of Network Formation
Section 8.2: Shortest path and small world effect
Models of Network Formation
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation
How Do “Real” Networks Look?
Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Network Science: A Short Introduction i3 Workshop
Models of Network Formation
Diffusion in Networks Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale 1/17/2019.
Zombies ate my Project Made by Lifan Zhang
Network Models Michael Goodrich Some slides adapted from:
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns

“Epidemos” Forest fire simulation:Forest fire simulation –grid of forest and vacant cells –fire always spreads to adjacent four cells “perfect” stickiness or infectiousness –connectivity parameter: probability of forest –fire will spread to all of connected component of source –tip when forest ~ 0.6 –clean mathematical formalization (e.g. fraction burned) Viral spread simulation:Viral spread simulation –population on a grid network, each with four neighbors –stickiness parameter: probability of passing disease –connectivity parameter: probability of rewiring local connections to random long-distance –no long distance connections: tip at stickiness ~ 0.3 –at rewiring = 0.5, often tip at stickiness ~ 0.2

“Mathematizing” the Forest Fire Start with a regular 2-dimensional grid network –this represents a complete forest Delete each vertex (and its edges) with probability p (independently) –this represents random “clear-cutting” or natural fire breaks Choose a random remaining vertex v –this is my campsite Q: What is the expected size of v’s connected component? –this is how much of the forest is going to burn

“Mathematizing” the Epidemic Start with a regular 2-dimensional grid network –this represents a dense population with “local” connections (neighbors) Rewire each edge with probability p to a random destination –this represents “long-distance” connections (chance meetings) Choose a random remaining vertex v –this is an infection; spreads probabilistically to each of v’s neighbors Fraction killed more complex: –depends on both size and structure of v’s connected component Important theme: –mixing regular, local structure with random, long-distance connections

Some Remarks on the Demos Connectivity patterns were either local or random –will eventually formalize such models –what about other/more realistic structure? Tipping was inherently a statistical phenomenon –probabilistic nature of connectivity patterns –probabilistic nature of disease spread –model likely properties of a large set of possible outcomes –can model either inherent randomness or variability Formalizing tipping in the forest fire demo: –might let grid size N  infinity, look at fixed values of p –is there a threshold value q: p < q  expected fraction burned < 1/10 p > q  expected fraction burned > 9/10

Structure and Dynamics Case Study: A “Contagion” Model of Economic Exchange Imagine an undirected, connected network of individuals –no model of network formation Start each individual off with some amount of currency At each time step: –each vertex divides their current cash equally among their neighbors –(or chooses a random neighbor to give it all to) –each vertex thus also receives some cash from its neighbors –repeat A transmission model of economic exchange --- no “rationality” Q: How does network structure influence outcome? A: As time goes to infinity: –vertex i will have fraction deg(i)/D of the wealth; D = sum of deg(i) –degree distribution entirely determines outcome! –“connectors” are the wealthiest –not obvious: consider two degree = 2 vertices… How does this outcome change when we consider more “realistic” dynamics? –e.g. we each have goods available for trade/sale, preferred goods, etc. What other processes have similar dynamics? –looking ahead: models for web surfing behavior