Diffusion in Networks 3-24-2010.

Slides:



Advertisements
Similar presentations
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Complex Networks Advanced Computer Networks: Part1.
Scale Free Networks.
Albert-László Barabási
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 16 Ýmir Vigfússon.
Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
Power Laws: Rich-Get-Richer Phenomena
Jure Leskovec, CMU Kevin Lang, Anirban Dasgupta, Michael Mahoney Yahoo! Research.
Diffusion in Networks Diffusion through social networks: why things spread Fun: i.e., why do things get popular? –Fashion, fads, internet memes,
Maximizing the Spread of Influence through a Social Network By David Kempe, Jon Kleinberg, Eva Tardos Report by Joe Abrams.
Graphs (Part I) Shannon Quinn (with thanks to William Cohen of CMU and Jure Leskovec, Anand Rajaraman, and Jeff Ullman of Stanford University)
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
CS Lecture 6 Generative Graph Models Part II.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
Information Cascades Todd Kaplan. Restaurant You go to a unfamiliar city such as Tel Aviv. Where do you decide to eat? – Restaurant A and B both look.
The structure of the Internet. The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet.
Diffusion – Diffusion of Innovations Diffusion is the process by which an Innovation is Communicated through certain Channels over Time among.
Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)
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.
(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
Analysis of Social Media MLD , LTI William Cohen
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
Graph Algorithms: Properties of Graphs? William Cohen.
(with an application of Web Spam detection) CS315-Web Search and Mining Power Laws and Rich-Get-Richer Phenomena.
Online Social Networks and Media
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Analysis of Social Media MLD , LTI William Cohen
Analysis of Social Media MLD , LTI William Cohen
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
Social Networking: Large scale Networks
(with an application of Web Spam detection) CS315-Web Search and Mining Power Laws and Rich-Get-Richer Phenomena.
Analyzing Networks. Milgram’s Experiments “Six degrees of Separation” Milgram’s letters to various recruits in Nebraska who were asked to forward the.
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Cascade Principles, Bayes Rule and Wisdom of the Crowds Lecture 6 (Largely drawn from Kleinberg book)
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Network (graph) Models
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Lecture 1: Complex Networks
Topics In Social Computing (67810)
What Stops Social Epidemics?
Models of networks (synthetic networks or generative models): Random, Small-world, Scale-free, Configuration model and Random geometric model By: Ralucca.
Diffusion and Viral Marketing in Networks
Normal Distributions.
CS224W: Social and Information Network Analysis
The Importance of Communities for Learning to Influence
Lecture 13 Network evolution
Peer-to-Peer and Social Networks Fall 2017
Peer-to-Peer and Social Networks
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Power Law.
Degree Distributions.
Modelling Structure and Function in Complex Networks
Section 8.3: Degree Distribution
Lecture 9: Network models CS 765: Complex Networks
Lecture 21 Network evolution
Log-periodic oscillations due to discrete effects in complex networks
Network Science: A Short Introduction i3 Workshop
Navigation and Propagation in Networks
Network Models Michael Goodrich Some slides adapted from:
Presentation transcript:

Diffusion in Networks 3-24-2010

Research questions & areas How do you model collections of documents in graphs? How do ideas spread through a network?  Hybrid models of text and connections  Models of diffusion and influence. Viral marketing Collaborative problem-solving. Analysis Language, Behavior People Networks Social Media

Diffusion through social networks: what things spread Behavior Smoking, product purchases, LOLCats, doing research in graphical models, …. Diseases H1N1 flue, bubonic plague, …. Information News, rumors, …

Diffusion through social networks: why things spread Fun: i.e., why do things get popular? Fashion, fads, internet memes, research ideas, … First-order approximation: preferential attachment in graphs Rational decisions Decisions made publically with limited information Specifically, decisions where choice is public but some evidence used in the choice is private Decisions made about products (or behaviors, etc) that have “network effects” (aka “externalities”) Specifically, the benefits and costs of the behavior are not completely local to the decision-maker

Review: Barabasi-Albert Networks Science 286 (1999) Start from a small number of node, add a new node with m links Preferential Attachment Probability of these links to connect to existing nodes is proportional to the node’s degree ‘Rich gets richer’ For citations: you’re more likely to cite something you found from another citation. This creates ‘hubs’: few nodes with very large degrees.

Preferential attachment (Barabasi-Albert) Random graph (Erdos Renyi) Artificial graph Preferential attachment (Barabasi-Albert)

Degree distribution Plot cumulative degree X axis is degree Y axis is #nodes that have degree at least k Typically use a log-log scale Straight lines are a power law; normal curve dives to zero at some point This defines a “scale” for the network Left: trust network in epinions web site from Richardson & Domingos

Diffusion through social networks: why things spread Fun: i.e., why do things get popular? Fashion, fads, internet memes, research ideas, … First-order approximation: preferential attachment in graphs Rational decisions: Decisions made publically with limited information Specifically, decisions where choice is public but some evidence used in the choice is private Decisions made about products (or behaviors, etc) that have “network effects” (aka “externalities”) Specifically, the benefits and costs of the behavior are not completely local to the decision-maker Start with some simple cases in a non-networked world

Making decisions with other people’s choices as an input Examples: Picking a crowded restaurant in a new city, instead of an empty one You have little information about the food quality But all those people can’t be wrong…? Picking a popular course instead of a smaller one …

Making decisions with other people’s choices as an input Simple example [Kleinberg 16.2]: An urn with a 50/50 chance of having: 2/3 red balls and 1/3 green balls; or 1/3 red balls and 2/3 green balls An experiment: in each trial t=1,2,… Researcher t will sample one ball (and then replaces it) guess what’s the majority class (red or green) Everyone that guesses right gets a payoff Nobody can change their guesses private public

Making decisions with other people’s choices as an input Possible outcome: A red ball: the guess is red A green ball: the guess is ___ ? Rational sequential decision-making leads to a cascade!

Making decisions with other people’s choices as an input Possible outcome: A red ball: the guess is red A green ball: the guess is ___ ? Rational sequential decision-making leads to a cascade! Thought experiment: suppose each researcher made a bet instead of voting -?