The Networked Nature of Society Networked Life CSE 112 Spring 2007 Prof. Michael Kearns.

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

Scale Free Networks.
Analysis and Modeling of Social Networks Foudalis Ilias.
Cognitive Publish/Subscribe for Heterogeneous Clouds Šarūnas Girdzijauskas, Swedish Institute of Computer Science (SICS) Joint work with:
Web as Network: A Case Study Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
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)
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.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
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.
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.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Economic Models of Network Formation Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Network Science and the Web: A Case Study Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Models of Influence in Online Social Networks
The Erdös-Rényi models
(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
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.
Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
CompSci Today’s topics Networks ä Definitions ä Modeling ä Analysis ä Slides from Michael Kearns - Univ. of Pennsylvania ä Slides from Patrick.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
Structural Properties of Networks: Introduction Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
The Structure, Function, and Evolution of Vascular Systems Instructor: Van Savage Spring 2010 Quarter 3/30/2010.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Social Networks, CompSci 49s, 11/16/20061 Social Networks as a Foundation for Computer Science Jeffrey Forbes
Slides are modified from Lada Adamic
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
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?
CS:4980:0005 Peer-to-Peer and Social Networks Fall 2015 Introduction.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
CompSci The Internet l How valuable is a network? ä Metcalfe’s Law l Domain Name System: translates betweens names and IP addresses l Properties.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
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.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Structural Properties of Networks: Introduction
Lecture 1: Introduction CS 765: Complex Networks
How Do “Real” Networks Look?
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
Peer-to-Peer and Social Networks Fall 2017
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
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
Graph and Link Mining.
Network Models Michael Goodrich Some slides adapted from:
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

The Networked Nature of Society Networked Life CSE 112 Spring 2007 Prof. Michael Kearns

What is a Network? A collection of individual or atomic entities Referred to as nodes or vertices (the “dots” or “points”) Collection of links or edges between vertices (the “lines”) Links can represent any pairwise relationship Links can be directed or undirected Network: entire collection of nodes and links For us, a network is an abstract object (list of pairs) and is separate from its visual layout –that is, we will be interested in properties that are layout-invariant Extremely general, but not everything: –e.g. menage a trois –may lose information by pairwise representation We will be interested in properties of networks –often structural properties –often statistical properties of families of networks

Some Handy Notions Network size: total number of vertices (denoted N) Maximum number of edges: N(N-1)/2 ~ N^2/2 Distance between vertices u and v: –number of edges on the shortest path from u to v –can consider directed or undirected cases –infinite if there is no path from u to v Diameter of a network: –worst-case diameter: largest distance between a pair –average-case diameter: average distance If the distance between all pairs is finite, we say the network is connected; else it has multiple components Degree of vertex v: number of edges connected to v

Types of Networks

“Real World” Social Networks 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 Kearns  Mansour  Alon  Erdos –how do we navigate in such networks? Example: acquaintanceship networks –vertices: people in the world –links: have met in person and know last names –hard to measure –let’s examine the results of our own last-names exerciselast-names exercise

Online Social Networks Now outdated and discredited example: Friendster –vertices: subscribers to –links: created via deliberate invitation –Here’s an interesting visualization by one uservisualization More recent and interesting: thefacebookthefacebook Older example: social interaction in LambdaMOO –LambdaMOO: chat environment with “emotes” or verbs –vertices: LambdaMOO usersLambdaMOO users –links: defined by chat and verb exchange –could also examine “friend” and “foe” sub-networks

MK’s Friendster NW, 1/19/04 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: –AOL IM BuddyzooBuddyzoo

Content Networks Example: document similarity –vertices: documents on the web –links: defined by document similarity (e.g. Google’s related search)related –here’s a very nice visualizationvisualization –not the web graph, but an overlay content network Of course, every good scandal needs a networkscandal –vertices: CEOs, spies, stock brokers, other shifty characters –links: co-occurrence in the same article –content network  social network Then there are conceptual networks –a thesaurus defines a networkthesaurus –so do the interactions in a mailing listmailing list

Business and Economic Networks Example: eBay bidding –vertices: eBay users –links: represent bidder-seller or buyer-seller –fraud detection: bidding rings Example: corporate boardscorporate boards –vertices: corporations –links: between companies that share a board member Example: corporate partnershipscorporate partnerships –vertices: corporations –links: represent formal joint ventures Example: goods exchange networksgoods exchange networks –vertices: buyers and sellers of commodities –links: represent “permissible” transactions

Physical Networks Example: the Internet –vertices: Internet routersInternet routers –links: physical connections –vertices: Autonomous Systems (e.g. ISPs)Autonomous Systems –links: represent peering agreements –latter example is both physical and business network Compare to more traditional data networkstraditional data networks Example: the U.S. power gridU.S. power grid –vertices: control stations on the power grid –links: high-voltage transmission lines –August 2003 blackout: classic example of interdependenceinterdependence

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)

Structure, Dynamics, Formation

Network Statics Emphasize purely structural properties –size, diameter, connectivity, degree distribution, etc. –may examine statistics across many networks –will also use the term topology to refer to structure Structure can reveal: –community –“important” vertices, centrality, etc. –robustness and vulnerabilities –can also impose constraints on dynamics Less emphasis on what actually occurs on network –web pages are linked… but people surf the web –buyers and sellers exchange goods and cash –friends are connected… but have specific interactions

Network Dynamics Emphasis on what happens on networks Examples: –mapping spread of disease in a social network –mapping spread of a fad –computation in the brain –spread of wealth in an economic network Statics and dynamics often closely linked –rate of disease spread (dynamic) depends critically on network connectivity (static) –distribution of wealth depends on network topology Gladwell emphasizes dynamics –but often dynamics of transmission –what about dynamics involving deliberation, rationality, etc.?

Network Formation Why does a particular structure emerge? Plausible processes for network formation? Generally interested in processes that are –decentralized –distributed –limited to local communication and interaction –“organic” and growing –consistent with (some) measurement The Internet versus traditional telephony

Structure, Dynamics, Formation: Two Brief Case Studies

Case Study 1: A “Contagion” Model of Economic Exchange Imagine an(y) 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

Case Study 2: Grandmother Cells, Associative Memory, and Random Networks A little more on the human brain: –(neo)cortex most “recently” evolved(neo)cortex –memory and higher brain function –closest to a crude “random network” all connections equally likely Localist or grandmother cell theory: –individual cells respond to complex stimuli Hebbian learning: –cells learn to fire when highly correlated neighboring cells fire –entirely decentralized allocation process The problem of associative memory: –consider “Pelican Brief” or “Networked Life” –requires that neurons representing “pelican” and “brief” have a common neighbor

A Back-of-the Envelope Analysis Let’s try assuming: –all connections equally likely –independent with probability p So: –at some point have learned “pelican” and “brief” in separate cells –need to have cells connected to both to learn conjunction –but not too many such cells! In this model, p ~ 1/sqrt(N) results in any pair of cells having just a few common neighbors! Broadly consistent with biology

Remarks Network formation: –random connectivity –is this how the brain grows? Network structure: –common neighbors for arbitrary cell pairs –implications for degree distribution Network dynamics: –distributed, correlation-based learning There is much that is broken with this story But it shows how a set of plausible assumptions can lead to nontrivial constraints

Recap We chose a particular, statistical model of network generation –each edge appears independently and with probability p –why? broadly consistent with long-distance cortex connectivity –a statistical model allows us to study variation within certain constraints We were interested in the NW having a certain structural property –any pair of vertices should have a small number of common neighbors –corresponds to controlled growth of learned conjunctions, in a model assuming distributed, correlated learning We asked whether our NW model and this property were consistent –yes, assuming that p ~ 1/sqrt(N) –this implies each neuron (vertex) will have about p*N ~ sqrt(N) neighbors –and this is roughly what one finds biologically (Note: this statement is not easy to prove)