Networked Life NETS 112 Fall 2019 Prof. Michael Kearns

Slides:



Advertisements
Similar presentations
Scale Free Networks.
Advertisements

‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
Network Matrix and Graph. Network Size Network size – a number of actors (nodes) in a network, usually denoted as k or n Size is critical for the structure.
School of Information University of Michigan Network resilience Lecture 20.
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.
On the Geographic Location of Internet Resources CSCI 780, Fall 2005.
Output Analysis and Experimentation for Systems Simulation.
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) ‏
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.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
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.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
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.
How Do “Real” Networks Look?
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Basic Concepts of Information Theory A measure of uncertainty. Entropy. 1.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Lecture 23: Structure of Networks
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
Structural Properties of Networks: Introduction
How Do “Real” Networks Look?
Community detection in graphs
Lecture 23: Structure of Networks
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?
Section 7.12: Similarity By: Ralucca Gera, NPS.
How Do “Real” Networks Look?
Models of Network Formation
Section 8.2: Shortest path and small world effect
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 2014 Prof. Michael Kearns
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Network Science: A Short Introduction i3 Workshop
Models of Network Formation
Introduction Wireless Ad-Hoc Network
Clustering Coefficients
Lecture 23: Structure of Networks
Lecture 14 Shortest Path (cont’d) Minimum Spanning Tree
Navigation and Propagation in Networks
Lecture 13 Shortest Path (cont’d) Minimum Spanning Tree
Network Models Michael Goodrich Some slides adapted from:
Presentation transcript:

Networked Life NETS 112 Fall 2019 Prof. Michael Kearns Contagion in Networks Networked Life NETS 112 Fall 2019 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

“Structural Virality” Goel, Anderson, Hofman, Watts Every video, news story, image, or petition posted to Twitter over 12 months (1.4 B observations) Restrict to “popular” cascades (> 100 RTs; ~350K events) For each event, can quantity its “structural virality” Average Pairwise Shortest Path Length Ranges from ≈2 (“broadcast”) ~log(N) (“viral”) For these “popular” events can ask: What diversity do we see with respect to structure? What is the relationship between size and structural virality? “Broadcast” “Viral”

Diversity of Structural Virality

Popular ≠ Viral Popularity driven mostly by the size of the largest broadcast