Download presentation
Presentation is loading. Please wait.
Published byNaděžda Křížová Modified over 5 years ago
1
Kempe-Kleinberg-Tardos Conjecture A simple proof
Lecture 2-5 Kempe-Kleinberg-Tardos Conjecture A simple proof Ding-Zhu Du University of Texas at Dallas First, I want to thank you for you presence. ********In this presentation I will try to introduce The social network which is a theoretical structure to study relationships between individuals, groups, organizations, or even entire societies. It is related to a wide range of disciplines. These disciplines include, but are not limited to information science, biology, economics, geography, communication studies, and so on.. The study of social networks begins with the late eighteenth century, two sociologists (Émile [ei'mi:l] Durkheim and Ferdinand ['fɝdənænd] Fer迪南de Tönnies) foreshadowed the idea of social networks in their theories and research of social groups. Nowadays, we study social networks using network analysis to identify social communities, pick influential person, and design good software.
2
Outline of KKT Conjecture
IM in Threshold Model KKT Conjecture A Simple Proof Applications Brief overview of social networks How to build applications on top of the social network – Think about a social network being MS Windows, We can build applications on it.
3
General Threshold Model
1 2 3
4
LT: Stop! w v Y Inactive Node 0.6 Active Node 0.2 Threshold 0.2 0.3
Active neighbors X 0.1 0.4 U 0.3 0.5 Stop! 0.2 0.5 w v
5
Inapproximability Theorem Proof Recall
6
Input size
7
is monotone submodular.
but not submodular.
8
Outline Threshold Model KKT Conjecture A Simple Proof Applications
Brief overview of social networks How to build applications on top of the social network – Think about a social network being MS Windows, We can build applications on it.
9
Kempe-Kleinberg-Tardos Conjecture
This conjecture is proved by Mossel and Roch in 2007 (STOC’07)
10
Linear Threshold (LT) Model
A node v has random threshold ~ U[0,1] A node v is influenced by each neighbor w according to a weight bw,v such that A node v becomes active when at least (weighted) fraction of its neighbors are active Given a random choice of thresholds, and an initial set of active nodes A0 (with all other nodes inactive), the diffusion process unfolds deterministically in discrete steps: in step t, all nodes that were active in step t-1 remain active, and we activate any node v for which the total weight of its active neighbors is at least Theta(v)
11
Example Stop! w v Y Inactive Node 0.6 Active Node 0.2 Threshold 0.2
0.3 Active neighbors X 0.1 0.4 U 0.3 0.5 Stop! 0.2 0.5 w v
12
Outline Threshold Model KKT Conjecture A Simple Proof Applications
Brief overview of social networks How to build applications on top of the social network – Think about a social network being MS Windows, We can build applications on it.
13
Idea: Piecemeal Growth
Seeds can be distributed step by step or altogether, the distribution of final influence set does not change.
14
Notations ~
15
Notations ~ ~ ~ ~
16
Lemma 1 Proof
17
1st Try ~ ~
18
1st Try
19
1st Try Not true!
20
More Techniques: Antisense Phase and Need-to-Know Representation
21
Antisense Phase ~ ~
22
Lemma 2 ~ ~ Proof
23
2nd Try ~ ~
24
2nd Try
25
Lemma 3 Proof
26
Outline Threshold Model KKT Conjecture A Simple Proof Applications
Brief overview of social networks How to build applications on top of the social network – Think about a social network being MS Windows, We can build applications on it.
27
Linear Threshold (LT) Model
A node v has random threshold ~ U[0,1] A node v is influenced by each neighbor w according to a weight bw,v such that A node v becomes active when at least (weighted) fraction of its neighbors are active Given a random choice of thresholds, and an initial set of active nodes A0 (with all other nodes inactive), the diffusion process unfolds deterministically in discrete steps: in step t, all nodes that were active in step t-1 remain active, and we activate any node v for which the total weight of its active neighbors is at least Theta(v)
28
Decreasing Cascade Model
29
Deterministic Model
30
Independent Cascade
31
Triggering Model
32
IC is a special cases of Triggering Model
33
LT(or MC) is a special cases of Triggering Model
34
Triggering Model Triggering model is not a general threshold model.
When triggering set at every node is fixed, it can be seen as a threshold model. Then # of influenced nodes is a monotone increasing submodular function of seed set. Triggering model is a linear combination of threshold models. Coefficients are probability.
35
“Only-Listen-Once” Model
36
References 1 2
37
1 2 3
38
1 1 2 3 2 3 1 1 2 3 2 3
39
1 2 3
40
Proof of Submodularity
41
Conjecture
42
THANK YOU!
43
Open Problem 1
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.