Competitive Viral Marketing Based on: S. Bharathi et al. Competitive Influence Maximization in Social Networks, WINE 2007. C. Budak et al. Limiting the.

Slides:



Advertisements
Similar presentations
Competition in VM – Completing the Circle. Previous work in Competitive VM Mainly follower’s perspective: given state (say of seed selection) of previous.
Advertisements

Viral Marketing – Learning Influence Probabilities.
LEARNING INFLUENCE PROBABILITIES IN SOCIAL NETWORKS Amit Goyal Francesco Bonchi Laks V. S. Lakshmanan University of British Columbia Yahoo! Research University.
COMP 621U Week 3 Social Influence and Information Diffusion
Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.
Spread of Influence through a Social Network Adapted from :
Maximizing the Spread of Influence through a Social Network
DAVA: Distributing Vaccines over Networks under Prior Information
Maximizing the Spread of Influence through a Social Network
Suqi Cheng Research Center of Web Data Sciences & Engineering
Efficient Control of Epidemics over Random Networks Marc Lelarge (INRIA-ENS) SIGMETRICS 09.
OMEN: A Probabilistic Ontology Mapping Tool Mitra et al.
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,
Guha et al (WWW 2004). Growing economic motivation to spread information & DISINFORMATION. Open standards and low barrier to publication on the Web. Unscrupulous.
Finding Effectors in Social Networks T. Lappas (UCR), E. Terzi (BU), D. Gunopoulos (UoA), H. Mannila (Aalto U.) Presented by: Eric Gavaletz 04/26/2011.
Influence Maximization
Maximizing the Spread of Influence through a Social Network
Simpath: An Efficient Algorithm for Influence Maximization under Linear Threshold Model Amit Goyal Wei Lu Laks V. S. Lakshmanan University of British Columbia.
Maximizing Product Adoption in Social Networks
Linear Functions and Their Properties Section 4.1.
Models of Influence in Online Social Networks
On Ranking and Influence in Social Networks Huy Nguyen Lab seminar November 2, 2012.
Influence and Correlation in Social Networks Mohammad Mahdian Yahoo! Research Joint work with Aris Anagnostopoulos and Ravi Kumar to appear in KDD’08.
1 1 MPI for Intelligent Systems 2 Stanford University Manuel Gomez Rodriguez 1,2 David Balduzzi 1 Bernhard Schölkopf 1 UNCOVERING THE TEMPORAL DYNAMICS.
Personalized Influence Maximization on Social Networks
Web Science Course Lecture: Social Networks - * Dr. Stefan Siersdorfer 1 * Figures from Easley and Kleinberg 2010 (
Network Analysis Diffusion Networks. Social Network Philosophy Social structure is visible in an anthill Movements & contacts one sees are not random.
Information Spread and Information Maximization in Social Networks Xie Yiran 5.28.
Social contexts of IS Ch. 3 – Boddy et al.
December 7-10, 2013, Dallas, Texas
Making change work for you THE SME PERSPECTIVE Tom Abram.
Maximizing the Spread of Influence through a Social Network David Kempe, Jon Kleinberg, Eva Tardos Cornell University KDD 2003.
Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, É va Tardos KDD 2003.
Xiaowei Ying, Xintao Wu Dept. Software and Information Systems Univ. of N.C. – Charlotte 2008 SIAM Conference on Data Mining, April 25 th Atlanta, Georgia.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Online Social Networks and Media
International Manufacturing Network Embeddedness and Innovative Performance Guannan Xu.
I NFORMATION C ASCADE Priyanka Garg. OUTLINE Information Propagation Virus Propagation Model How to model infection? Inferring Latent Social Networks.
Lecture 3-1 Independent Cascade Weili Wu Ding-Zhu Du University of Texas at Dallas.
On Bharathi-Kempe-Salek Conjecture about Influence Maximization Ding-Zhu Du University of Texas at Dallas.
1 Latency-Bounded Minimum Influential Node Selection in Social Networks Incheol Shin
IMRank: Influence Maximization via Finding Self-Consistent Ranking
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Cascading.
Instructor: Shengyu Zhang 1. Location change for the final 2 classes Nov 17: YIA 404 (Yasumoto International Academic Park 康本國際學術園 ) Nov 24: No class.
Learning-oriented Organizational Improvement Processes Review of selected research with an emphasis on network perspectives.
Lecture 5-2 Target-Influence and Power Law Graphs Ding-Zhu Du Univ of Texas at Dallas.
LECTURE 14 The Diffusion of Innovations II 1. Cumulative and Individual Adoption Patterns 2.
Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University
Yu Wang1, Gao Cong2, Guojie Song1, Kunqing Xie1
Efficient Influence Maximization in Large-scale Social Networks
Nanyang Technological University
Secretary Markets with Local Information
Independent Cascade Model and Linear Threshold Model
Greedy & Heuristic algorithms in Influence Maximization
Probability Theory and Parameter Estimation I
Manuel Gomez Rodriguez
Influence Maximization
Independent Cascade Model and Linear Threshold Model
Influence Maximization
Maximizing the Spread of Influence through a Social Network
The Importance of Communities for Learning to Influence
Bharathi-Kempe-Salek Conjecture
Kempe-Kleinberg-Tardos Conjecture A simple proof
Influence Maximization
Viral Marketing over Social Networks
Discovering Influential Nodes From Social Trust Network
Independent Cascade Model and Linear Threshold Model
And Competitive Influence
Presentation transcript:

Competitive Viral Marketing Based on: S. Bharathi et al. Competitive Influence Maximization in Social Networks, WINE C. Budak et al. Limiting the spread of misinformation in social networks. In WWW'11. A. Borodin et al. Threshold models for competitive influence in social networks. In Proc. 6th Workshop on Internet and Network Economic, X. He et al. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model. In Proc SIAM Conf. on Data Mining, pages 463–474, W. Chen et al. Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate. In SDM, pages 379–390, 2011.

Why Competition? To be blunt, non-competitive is not super realistic. Marketing of products, spread of ideas, innovations, political campaigns – all involve competition.

A Model Core – independent cascade.

The Model Core – independent cascade. Inacti -ve active Note: In this and subsequent models, we will use color as a metaphor for state. Many shades of activity

The Model Core – independent cascade.

The Model Core – independent cascade.

The Model What if competing campaigns succeeded in activating a node?

The Model What if competing campaigns succeeded in activating a node? Note: Ties avoided elegantly using the notion of time delay for activation, which is a continuous random variable.

Properties of the Model

Discrete Time Models Recall, classical IC/LT models are discrete time. Use of continuous time in Bharathi et al.’s competitive IC model is mainly to avoid ties in activation by rival campaigns. Discrete time will bring us back to ties and we need tie-breaking rules. E.g., competitive IC model: what if two different companies succeed in activating a node? Several options exist.

(Discrete Time) CIC Model

CIC Model (contd.) Successful attempts by blue-active in-neighbors. Successful attempts by red-active in-neighbors.

CIC Model (contd.)

CIC Model (concluded)

Competitive LT (CLT) Model

CLT Model (contd.)

CIC – Equiv. Live-Edge Model

CIC – Equivalent Live-Edge Model

CLT – Equivalent Live-Edge Model

What do we want to optimize?

What else do we want to optimize?

Influence Maximization under Competition