Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Slides:



Advertisements
Similar presentations
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Advertisements

Excursions in Modern Mathematics(Tannenbaum) and Thinking Mathematically (Blitzer)
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.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
On the Geographic Location of Internet Resources CSCI 780, Fall 2005.
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.
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.
Social Networks: Advertising, Pricing and All That Zvi Topol & Itai Yarom.
Contagion and Tipping in Networks Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
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.
The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
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.
Random Graph Models of Social Networks Paper Authors: M.E. Newman, D.J. Watts, S.H. Strogatz Presentation presented by Jessie Riposo.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
Contagion, Tipping and Navigation in Networks Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns.
Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Introduction Random Process. Where do we start from? Undergraduate Graduate Probability course Our main course Review and Additional course If we have.
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.
Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
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.
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.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Connectivity and the Small World
Structural Properties of Networks: Introduction
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Trading in Networks: I. Model
Structural Properties of Networks: Introduction
How Do “Real” Networks Look?
Section 8.6: Clustering Coefficients
Community detection in graphs
Structural Properties of Networks: Introduction
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Section 8.6 of Newman’s book: Clustering Coefficients
How Do “Real” Networks Look?
How Do “Real” Networks Look?
Models of Network Formation
Centralities (4) Ralucca Gera,
Models of Network Formation
Peer-to-Peer and Social Networks Fall 2017
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation
How Do “Real” Networks Look?
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Network Science: A Short Introduction i3 Workshop
Models of Network Formation
Clustering Coefficients
Katz Centrality (directed graphs).
CSE 373: Data Structures and Algorithms
Lecture 21 Network evolution
Network Models Michael Goodrich Some slides adapted from:
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

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

Two Models of Network Formation Start with a grid, remove random fraction of vertices “local” or “geographic” connectivity Start with N isolated vertices, add random edges “long distance” connectivity Examine a deterministic contagion model Widespread infection occurs at “tipping point” of connectivity

“Mathematizing” the Forest Fire (see Coursera “Contagion” video) Start with a regular 2-dimensional grid network this represents a complete forest Delete each vertex (and all 4 of its edges) with probability 1-p p is fraction of forest, 1-p is fraction of parking lots or clear-cut Choose a random remaining vertex v this is my campsite Q: What is the expected size of v’s connected component? i.e. the number of vertices reachable from v this is how much of the forest is going to burn Observe a “tipping point” around p = 0.6

“Mathematizing” the Average Degree Demo (see Coursera “Contagion” video) Let d be the desired average degree in a network of N vertices Then the total number of edges should be Just start connecting random pairs of vertices until you have e edges Pick a random vertex v to infect What is the size of v’s connected component? Observe a “tipping point” around d=3

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