Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Cascading.

Slides:



Advertisements
Similar presentations
The role of compatibility in the diffusion of technologies in social networks Mohammad Mahdian Yahoo! Research Joint work with N. Immorlica, J. Kleinberg,
Advertisements

Observational Learning in Random Networks Julian Lorenz, Martin Marciniszyn, Angelika Steger Institute of Theoretical Computer Science, ETH.
Nagel: Unraveling in Guessing Games: An Experimental Study Economics 328 Spring 2005.
Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) Columbia University Joint CS/EE Networking Seminar June 2, 2011.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
How to Schedule a Cascade in an Arbitrary Graph F. Chierchetti, J. Kleinberg, A. Panconesi February 2012 Presented by Emrah Cem 7301 – Advances in Social.
Spread of Influence through a Social Network Adapted from :
Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) WIDS MIT, May 31, 2011.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Online Social Networks and Media Cascading Behavior in Networks Epidemic Spread Influence Maximization.
Noam Nisan, Michael Schapira, Gregory Valiant, and Aviv Zohar.
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
What is Diffusion? The process of communicating innovation through certain channels over time through members of a social system.
Maximizing the Spread of Influence through a Social Network
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Nodes, Ties and Influence
Based on “Cascading Behavior in Networks: Algorithmic and Economic Issues” in Algorithmic Game Theory (Jon Kleinberg, 2007) and Ch.16 and 19 of Networks,
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Re-examining the cascade problem: “... most of the time the system is completely stable, even in the face of external shocks. But once in a while, for.
Dynamic Network Security Deployment under Partial Information George Theodorakopoulos (EPFL) John S. Baras (UMD) Jean-Yves Le Boudec (EPFL) September 24,
QR 38, 2/15/07 Extensive form games I.Writing down a game II.Finding the equilibrium III.Adding complexity.
Viral Marketing. What is Viral Marketing? Definition: – A marketing strategy that relies on people rather than campaigns – Increasing brand awareness.
Chapter 6 Consumer Attitudes Consumer Attitudes.
PowerPoint Presentation by Charlie Cook The University of West Alabama Copyright © 2006 Thomson Business & Professional Publishing. All rights reserved.
Diffusion; Technology and the Competition n Narayanan Chapters 4 & 5.
Diffusion of Innovation Theories, models, and future directions.
Copyright © 2006 Pearson Education Canada Inc. Chapter 13 Consumer Influence and the Diffusion of Innovations Consumer Behaviour Canadian Edition Schiffman/Kanuk/Das.
Diffusion of Innovations Theory Tyra JanssonTyra Jansson H571 Principles of Health BehaviorH571 Principles of Health Behavior.
Consumer Influence Word-of-Mouth Communication Opinion Leadership Diffusion of Innovations.
Exploration into the barriers and obstacles constraining diffusion and adoption of renewable energy solutions Saskia Harkema and Mirjam Leloux Wittenborg.
Models of Influence in Online Social Networks
01/16/2002 Reliable Query Reporting Project Participants: Rajgopal Kannan S. S. Iyengar Sudipta Sarangi Y. Rachakonda (Graduate Student) Sensor Networking.
Thinking Actively in a Social Context T A S C.
Online Social Relationships [Isbell et al.]. Internet Connections (CAIDA)
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Internet Economics כלכלת האינטרנט
Network Economics: two examples Marc Lelarge (INRIA-ENS) SIGMETRICS, London June 14, 2012.
Online Social Networks and Media
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
Presented by Qian Zou.  The purpose of conducting the experiments.  The methodology for the experiments.  The Experimental Design : Cohesion Experiments.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Cascading Behavior in Networks Chapter 19, from D. Easley and J. Kleinberg.
Goals  Correlation/dependency: The storing of correlations and dependencies  Integration: Methodology for integrating correlated risk distributions into.
Some Analysis of Coloring Experiments and Intro to Competitive Contagion Assignment Prof. Michael Kearns Networked Life NETS 112 Fall 2014.
Prof. Ashry Gad Mohamed Prof. of Epidemiology College of Medicine, KSU Nutrition Education.
Dynamic Games & The Extensive Form
 Building Networks. First Decisions  What do the nodes represent?  What do the edges represent?  Know this before doing anything with data!
Theories of Communication Effects: Communication Science & Research
Extensive Games with Imperfect Information
Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, É va Tardos KDD 2003.
Diffusion of Innovation
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Auctions.
Network Intervention By Thomas W. Valente Yilin sun.
How to Analyse Social Network? : Part 2 Game Theory Thank you for all referred contexts and figures.
1 Latency-Bounded Minimum Influential Node Selection in Social Networks Incheol Shin
Algorithms For Solving History Sensitive Cascade in Diffusion Networks Research Proposal Georgi Smilyanov, Maksim Tsikhanovich Advisor Dr Yu Zhang Trinity.
The Information School of the University of Washington Technology Acceptance and Personal Innovativeness Unsworth INFO 310 Monday, April 05, 2004.
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Link Prediction.
Findings – January  Respondents  Access to the practice  Repeat prescription service  Test results  Practice staff  Overall satisfaction 
Social Networks Strong and Weak Ties
Summary of the lesson: 1. Relationship between Strategic Planning, Social Responsibility and Business Ethics. 2. Strategic Planning issues. 3. Social Responsibilities.
Diffusion of Innovation Theory
New models for power law:
What Stops Social Epidemics?
Director of Employer Partnerships
If nodes v and w are linked by an edge,
Online Social Relationships
The Strength of Weak Ties
Diffusion and Viral Marketing in Networks
Diffusion in Networks Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale 1/17/2019.
The Iowa Study of Hybrid Seed Corn: The Adoption of Innovation
Presentation transcript:

Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Cascading Behavior in Networks Prof. Dr. Steffen Staab

Steffen Staab 2WeST How could  the first telephone/  first hundred telephones ever be sold? Why is Facebook less suitable for propagating political ideas than Twitter? (speculation!)

Steffen Staab 3WeST Diffusion in Networks  Information cascade, Network effects, and Rich-get-richer:  View the network as a relatively amorphous population of individuals, and look at effects in aggregate;  Global level  Diffusion in networks:  View the fine structure of the network as a graph, and look at how individuals are influenced by their particular network neighbors.  Local level

Steffen Staab 4WeST Diffusion of Innovations  Considering how new  behaviors,  practices,  opinions,  conventions, and  technologies spread from person to person through a social network Success criteria for adoption of innovation depend on: Relative advantage Complexity For people to understand Observability For people to observe that others are using it Trialability Gradual take-up possible (counterexample: magnetic monorail) Compatibility With social system

Steffen Staab 5WeST A Networked Coordination Game  If nodes v and w are linked by an edge, then there is an incentive for them to have their behaviors match  v and w are the players  Two possible behaviors, labeled A and B  A and B are the possible strategies  The payoffs are defined as follows:  if v and w both adopt behavior A, they each get a payoff of a > 0;  if they both adopt B, they each get a payoff of b > 0; and  if they adopt opposite behaviors, they each get a payoff of 0

Steffen Staab 6WeST A Networked Coordination Game  Suppose that some of v neighbors adopt A, and some adopt B; what should v do in order to maximize its payoff?  v has d neighbors  a p fraction of them have behavior A  a 1-p fraction have behavior B  If v chooses A, it gets a payoff of pda  If v chooses B, it gets a payoff of (1-p)db

Steffen Staab 7WeST A Networked Coordination Game  The game is played along all edges

Steffen Staab 8WeST A Networked Coordination Game  A is a better choice if: Or:  Threshold rule: If at least a q = b/(a+b) fraction of your neighbors follow behavior A, then you should too.

Steffen Staab 9WeST Cascading Behavior  Two obvious equilibria:  Everyone adopts A, and  Everyone adopts B.  How easy is it to ‘tip’ a network?  Initially everyone is using B  A few early adopters are using A

Steffen Staab 10WeST Tipping a = 3 b = 2 q = 2/(3+2) = 2/5

Steffen Staab 11WeST Tipping a = 3 b = 2 q = 2/(3+2) = 2/5

Steffen Staab 12WeST Intermediate Equilibria a = 3 b = 2 q = 2/(3+2) = 2/5

Steffen Staab 13WeST Intermediate Equilibria

Steffen Staab 14WeST Intermediate Equilibria tightly-knit communities in the network can work to hinder the spread of an innovation

Steffen Staab 15WeST Cascades of adoption  The chain reaction of switches to A is called a cascade of adoptions of A,  Two fundamental possibilities exist: (i) that the cascade runs for a while but stops while there are still nodes using B, or (ii) that there is a complete cascade, in which every node in the network switches to A. If the threshold to switch is q, we say that the set of initial adopters causes a complete cascade at threshold q.

Steffen Staab 16WeST Viral Marketing  Strategy I: Making an existing innovation slightly more attractive can greatly increase its reach.  E.g. in our example: Changing a = 3 to a = 4 (new threshold q = 1/3) will result in a complete cascade.

Steffen Staab 17WeST Viral Marketing  Strategy II: convince a small number of key people in the part of the network using B to switch to A.  E.g. in our example: Convincing node 12 or 13 to switch to A will cause all of nodes 11–17 to switch. (Convincing 11 or 14 would not work)

Steffen Staab 18WeST Reflection  Population-level network effects  Decisions based on the overall fraction.  Hard to start for a new technology, even when it is better.  Network-level cascading adoption  Decisions based on immediate neighbors  A small set of initial adopters are able to start a cascade.

Steffen Staab 19WeST Cascades and Clusters  Definition (Densely connected community): We say that a cluster of density p is a set of nodes such that each node in the set has at least a p fraction of its network neighbors in the set.  the set of all nodes is always a cluster of density 1  the union of two clusters with density p has also density p  Homophily can often serve as a barrier to diffusion, by making it hard for innovations to arrive from outside densely connected communities. Three four node clusters with density d = 2/3

Steffen Staab 20WeST Relationship between Clusters and Cascades Claim: Consider a set of initial adopters of behavior A, with a threshold of q for nodes in the remaining network to adopt behavior A. (i) If the remaining network contains a cluster of density greater than 1 − q, then the set of initial adopters will not cause a complete cascade. (ii) Moreover, whenever a set of initial adopters does not cause a complete cascade with threshold q, the remaining network must contain a cluster of density greater than 1 − q.

Steffen Staab 21WeST Example Clusters of density greater than 1 − 2/5 = 3/5 block the spread of A at threshold 2/5.

Steffen Staab 22WeST Part (i): Clusters are Obstacles to Cascades The spread of a new behavior, when nodes have threshold q, stops when it reaches a cluster of density greater than (1 − q).

Steffen Staab 23WeST Part (ii): Clusters are the Only Obstacles to Cascades If the spread of A stops before filling out the whole network, the set of nodes that remain with B form a cluster of density greater than 1 − q.

Steffen Staab 24WeST Diffusion, Thresholds, and the Role of Weak Ties There is a crucial difference between learning about a new idea and actually deciding to adopt it. The years of first awareness and first adoption for hybrid seed corn in the Ryan-Gross study.

Steffen Staab 25WeST Example Steps become aware of A but never adopt it.

Steffen Staab 26WeST Strength-of-weak-ties The u-w and v-w edges are more likely to act as conduits for information than for high-threshold innovations. Initial adopters: w and x Threshold: q = 1/2

Steffen Staab 27WeST Heterogeneous Thresholds:  Suppose that each person in the social network values behaviors A and B differently => each node v, has its own payoffs a v and b v  Now, A is the better choice if  Each node v has its own personal threshold q v, and it chooses A if at least a q v fraction of its neighbors have done so. Extensions of the Basic Cascade Model = q v

Steffen Staab 28WeST Example & Influenceable nodes Influenceable nodes are nodes with a low threshold

Steffen Staab 29WeST Example & Blocking cluster A set of initial adopters will cause a complete cascade (with a given set of node thresholds) if and only if the remaining network does not contain a blocking cluster. Blocking cluster in the network is a set of nodes for which each node v has more than a 1−q v fraction of its friends also in the set.

Steffen Staab 30WeST Knowledge, Thresholds, and Collective Action Integrating network effects at both the population level and the local network level.  We consider situations where coordination across a large segment of the population is important, and the underlying social network is serving to transmit information about people’s willingness to participate.  Collective action problem: A positive payoff if a lot of people participate, a negative payoff if only a few participate (e.g. protest under a repressive regime).  Pluralistic ignorance: People have wildly erroneous estimates about the prevalence of certain opinions in the population at large.

Steffen Staab 31WeST A Model for the Effect of Knowledge on Collective Action  Suppose that each person in a social network has a personal threshold which encodes her willingness to participate.  A threshold of k means, “I will show up for the protest if I am sure that at least k people in total (including myself) will show up.”  Each node only knows its and its neighbors threshold

Steffen Staab 32WeST  Weak ties  Better for access to new information  Strong ties  Better for collective action

Steffen Staab 33WeST Common Knowledge and Social Institutions.  A widely-publicized speech, or an article in a high- circulation newspaper, has the effect not just of transmitting a message, but of making the listeners or readers realize that many others have gotten the message as well

Steffen Staab 34WeST  And the first telephones could be sold, because they could provide sufficient benefit in a tightly enough knit network!  Not due to population counts!

Steffen Staab 35WeST