1. lidong.wu@utdallas.edu Lecture 5-1 Positive Influence Dominating Set Ding-Zhu Du Univ of Texas at Dallas

2. Social Networks >1000 million users The 3 rd largest “Country” in the world More visitors than Google More than 6 billion images 2009, 2 billion tweets per quarter 2010, 4 billion tweets per quarter 2011, tweets per quarter >780 million users Pinterest, with a traffic higher than Twitter and Google 25 billion 2013, users, 40 % yearly increase 400 million 2

3. A Trillion Dollar Opportunity Online Social networks have become a bridge to connect our daily physical life and the virtual web space On2Off Commerce [1] [1] Online to Offline is trillion dollar business http://techcrunch.com/2010/08/07/why-online2offline-commerce-is-a-trillion-dollar-opportunity/ 3

4. “Love Obama” I love Obama Obama is great! Obama is fantastic I hate Obama, the worst president ever He cannot be the next president! No Obama in 2012! Positive Negative 4

5. What is Social Influence? Social influence occurs when one's opinions, emotions, or behaviors are affected by others, intentionally or unintentionally. [1] – Informational social influence: to accept information from another; – Normative social influence: to conform to the positive expectations of others. [1] http://en.wikipedia.org/wiki/Social_influence 5

6. Three Degree of Influence Three degree of Influence [2] [1] S. Milgram. The Small World Problem. Psychology Today, 1967, Vol. 2, 60–67 [2] J.H. Fowler and N.A. Christakis. The Dynamic Spread of Happiness in a Large Social Network: Longitudinal Analysis Over 20 Years in the Framingham Heart Study. British Medical Journal 2008; 337: a2338 [3] R. Dunbar. Neocortex size as a constraint on group size in primates. Human Evolution, 1992, 20: 469–493. Six degree of separation [1] You are able to influence up to over 1,000,000 persons in the world, according to the Dunbar’s number [3]. 6

7. Viral Marketing Viral marketing or word of mouth strategy – exploits the social network values of customers – the most effective marketing strategy To study the effects of “word of mouth” in the promotion of new products, Domingos and Richardson posed an algorithmic problem in the year 2001.

8. Illustrative Example :Influence Maximization A new product is available in the market. Whom to give free samples to maximize the purchase of the product ? 8

9. Problem Setting Given – a market (e.g. a set of individuals) – estimates for influence between individuals Goal – Minimum budget for initial advertising (e.g. give away free samples of product) in order to occupy the market. Question – Which set of individuals should we target at? Application besides product marketing – spread an innovation, ideas, news – detect stories in blogs – analyze Twitter 9

10. Product Advertisement 10

11. More Companies: Competition 11

12. How to Measure Influence? 12

13. A Winning Strategy: Positive Influence 13

14. Positive Influence is a Special Threshold Model 14 This is not submodular! A B x

15. Positive-Influence Max 15 A B x

16. Min Positive-influence Dominating Set Given a network, Find a minimum positive-influence dominating set. 16

17. Greedy Algorithm

18. Section 2.4 18

19. A General Problem

20. Greedy Algorithm

21. A General Theorem Remark:

22. Xu Zhu, Jieun Yu, Wonjun Lee, Donghyun Kim, Shan Shan, Ding-Zhu Du: New dominating sets in social networks. J. Global Optimization 48(4): 633-642 (2010) Xu ZhuJieun YuWonjun LeeDonghyun Kim Shan J. Global Optimization 48 22 Min Positive Dominating Set is APX-had. There exist a polynomial-time (1+ln 1.5Δ)- approximation.

23. Potential Function 23 Lemma 1 Proof 1 2 3

24. Proof of 24 1 A B x v

25. Proof of 25 2

26. 26

27. Proof of 27 3

28. Lemma 2(a) 28 Proof

29. Lemma 2(b) 29 Proof

30. Greedy Algorithm

31. A General Theorem Remark:

32. Theorem

33. Thang N. Dinh, Yilin Shen, Dung T. Nguyen, My T. Thai: On the approximability of positive influence dominating set in social networks. J. Comb. Optim. 27(3): 487-503 (2014) Thang N. DinhYilin ShenDung T. NguyenJ. Comb. Optim. 27 33 Theorem

34. Open Problem 1 34

35. Open Problem 2 35

36. Open Problem 3 36

37. THANK YOU!