“The Tipping Point” and the Networked Nature of Society Michael Kearns Computer and Information Science Penn Reading Project 2004.

Slides:



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

Scale Free Networks.
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Analysis and Modeling of Social Networks Foudalis Ilias.
Web as Network: A Case Study Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
Course Introduction and Overview Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Course Introduction and Overview Networked Life Market and Social Systems Engineering (MKSE) 112 Fall 2012 Prof. Michael Kearns.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Mining and Searching Massive Graphs (Networks)
Course Overview and Introduction Networked Life CSE 112 Spring 2005 Prof. Michael Kearns.
Course Introduction and Overview Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
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.
From Local Incentives to Global Outcomes Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Course Introduction and Overview Networked Life CIS 112 Spring 2009 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.
Advanced Topics in Data Mining Special focus: Social Networks.
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.
Course Introduction and Overview Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
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.
Course Overview and Introduction Networked Life CSE 112 Spring 2004 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.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
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.
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.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Social Networks, CompSci 49s, 11/16/20061 Social Networks as a Foundation for Computer Science Jeffrey Forbes
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Fundamental Limitations of Networked Decision Systems Munther A. Dahleh Laboratory for Information and Decision Systems MIT AFOSR-MURI Kick-off meeting,
How Do “Real” Networks Look?
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
CompSci The Internet l How valuable is a network? ä Metcalfe’s Law l Domain Name System: translates betweens names and IP addresses l Properties.
CompSci The Internet l How valuable is a network? ä Metcalfe’s Law l Domain Name System: translates betweens names and IP addresses l Properties.
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.
Structural Properties of Networks: Introduction
The Internet Domain Name System: translates betweens names and IP addresses Properties of the Internet Heterogeneity Redundancy Packet-switched 604 million.
Topics In Social Computing (67810)
Structural Properties of Networks: Introduction
Course Introduction and Overview
Course Introduction and Overview
Course Introduction and Overview
How Do “Real” Networks Look?
Course Introduction and Overview
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
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
Models of Network Formation
Diffusion in Networks
Network Models Michael Goodrich Some slides adapted from:
Course Introduction and Overview
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

“The Tipping Point” and the Networked Nature of Society Michael Kearns Computer and Information Science Penn Reading Project 2004

Gladwell, page 7: “The Tipping Point is the biography of the idea… that the best way to understand the emergence of fashion trends, the ebb and flow of crime waves, or the rise in teen smoking… is to think of them as epidemics. Ideas and products and messages and behaviors spread just like viruses do…” …on networks.

The Networked Nature of Society

International Trade [Krempel&Pleumper ]

Corporate Partnerships [Krebs ]

Gnutella

Internet Routers

Artist Mark Lombardi

An Emerging Science

Examining apparent similarities between many human and technological systems & organizations Importance of network effects in such systems How things are connected matters greatly Structure, asymmetry and heterogeneity Details of interaction matter greatly The metaphor of viral spread Qualitative and quantitative; can be very subtle A revolution of –measurement –theory –breadth of vision

Who’s Doing All This? Computer Scientists –Understand and design complex, distributed networks –View “competitive” decentralized systems as economies Social Scientists, Psychologists, Economists –Understand human behavior in “simple” settings –Revised views of economic rationality in humans –Theories and measurement of social networks Physicists and Mathematicians –Interest and methods in complex systems –Theories of macroscopic behavior (phase transitions) All parties are interacting and collaborating

“Real World” Social Networks Example: Acquaintanceship networks –vertices: people in the world –links: have met in person and know last names –hard to measure –let’s do our own Gladwell estimateGladwell estimate Example: scientific collaboration –vertices: math and computer science researchers –links: between coauthors on a published paper –Erdos numbers : distance to Paul ErdosErdos numbers –Erdos was definitely a hub or connector; had 507 coauthors –MK’s Erdos number is 3, via Mansour  Alon  Erdos –how do we navigate in such networks?

Update: MK’s Friendster NW, 1/19/03 If you didn’t get my invite, let me know –send mail to Number of friends (direct links): 8 NW size (<= 4 hops): 29,901 13^4 ~ 29,000 But let’s look at the degree distributiondegree distribution So a random connectivity pattern is not a good fit What is??? Another interesting online social NW: [thanks Albert Ip!] –AOL IM BuddyzooBuddyzoo

Biological Networks Example: the human brain –vertices: neuronal cells –links: axons connecting cells –links carry action potentials –computation: threshold behavior –N ~ 100 billion –typical degree ~ sqrt(N) –we’ll return to this in a moment…

Universality and Generative Models

A “Canonical” Natural Network has… Few connected components: –often only 1 or a small number independent of network size Small diameter: –often a constant independent of network size (like 6) –or perhaps growing only logarithmically with network size –typically exclude infinite distances A high degree of clustering: –considerably more so than for a random network –in tension with small diameter A heavy-tailed degree distribution: –a small but reliable number of high-degree vertices –quantifies Gladwell’s connectors –often of power law form

Some Models of Network Generation Random graphs (Erdos-Renyi models): –gives few components and small diameter –does not give high clustering and heavy-tailed degree distributions –is the mathematically most well-studied and understood model Watts-Strogatz and related models: –give few components, small diameter and high clustering –does not give heavy-tailed degree distributions Preferential attachment: –gives few components, small diameter and heavy-tailed distribution –does not give high clustering Hierarchical networks: –few components, small diameter, high clustering, heavy-tailed Affiliation networks: –models group-actor formation Nothing “magic” about any of the measures or models

So Which Properties Tip? Just about all of them! The following properties all have threshold functions: –having a “giant component” –being connected –having a perfect matching (N even) –having “small” diameter Demo: look at the following progression –giant component  connectivity  small diameter –in graph process model (add one new edge at a time) –[example 1] [example 2] [example 3] [example 4] [example 5][example 1][example 2][example 3][example 4][example 5] With remarkable consistency (N = 50): –giant component ~ 40 edges, connected ~ 100, small diameter ~ 180

“Epidemos” [Thanks to Sangkyum Kim] 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 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 adding random (long-distance) connections –no long distance connections: tip at stickiness ~ 0.3 –at rewiring = 0.5, often tip at stickiness ~ 0.2

Incorporating Strategic and Economic Behavior

Examples from Schelling and Beyond Going to the beach or not –too few  you’ll go, making it more crowded –too many  you won’t go, or will leave if you’re there Sending Christmas cards –people send to those they expect will send to them –everybody hates it, but no individual can break the cycle Investing in an apartment fire sprinkler –only worth it if enough people do it –insurance companies won’t discount for it Choosing where to sit in the Levine Auditorium

Local Preferences and Segregation Special case of preferences: housing choices Imagine individuals who are either “red” or “blue” They live on in a grid world with 8 neighboring cells Neighboring cells either have another individual or are empty Individuals have preferences about demographics of their neighborhood Here is a very nice simulatorsimulator

A Sample Network and Equilibrium Solid edges: –exchange at equilibrium Dashed edges: –competitive but unused Dotted edges: –non-competitive prices Note price variation –0.33 to 2.00 Degree alone does not determine price! –e.g. B2 vs. B11 –e.g. S5 vs. S14

The Internet as Society

The Internet: What is It? The Internet is a massive network of connected but decentralized computers Began as an experimental research NW of the DoD (ARPAnet) in the 1970s All aspects (protocols, services, hardware, software) evolved over many years Many individuals and organizations contributed Designed to be open, flexible, and general from the start Completely unlike prior centralized, managed NWs –e.g. the AT&T telephone switching network

Hubs and Authorities Suppose we have a large collection of pages on some topic –possibly the results of a standard web search Some of these pages are highly relevant, others not at all How could we automatically identify the important ones? What’s a good definition of importance? Kleinberg’s idea: there are two kinds of important pages: –authorities: highly relevant pages –hubs: pages that point to lots of relevant pages –(I had these backwards last time…) If you buy this definition, it further stands to reason that: –a good hub should point to lots of good authorities –a good authority should be pointed to by many good hubs –this logic is, of course, circular We need some math and an algorithm to sort it out

Networked Life (CSE 112) web site: – –these slides: Feel free to contact me at