whom to befriend to influence peopleinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · viral...
TRANSCRIPT
![Page 1: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/1.jpg)
WHOM TO BEFRIEND TO
INFLUENCE PEOPLE
Manuel Lafond (University of Montreal)
Lata Narayanan (Concordia University)
Kangkang Wu (Concordia University)
![Page 2: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/2.jpg)
The plan
Introduction
MinLinks problem: diffusion by giving links
Hardness of MinLinks
Basic idea behind the reduction
Some cases we can handle
Trees, cycles, cliques
Conclusion
![Page 3: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/3.jpg)
Viral marketing
Influencers
…
GOAL: make a network adopt a product/idea through the word-of-mouth effect,
starting with a small set of influencers.
QUESTION: how do we find this small set of influencers?
![Page 4: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/4.jpg)
Alice wants to be loved by all
1
2
2
3
1
Nodes = people
Edges = friendship links
![Page 5: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/5.jpg)
Alice wants to be loved by all
Influence threshold:
once 2 friends tell this node how
great Alice is, it will:
- become "activated"
- tell its friends how great Alice is
1
2
2
3
1
![Page 6: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/6.jpg)
Alice wants to be loved by all
Influence threshold:
once 2 friends tell this node how
great Alice is, it will:
- become "activated"
- tell its friends how great Alice is
1
2
2
3
1
Alice can buy links to friends, and
tell them how great she is.
GOAL: activate the entire network
with a minimum number of links.
![Page 7: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/7.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
![Page 8: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/8.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
Threshold is met.
Node gets activated.
![Page 9: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/9.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
Threshold is met.
Node gets activated.
![Page 10: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/10.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
![Page 11: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/11.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
![Page 12: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/12.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
![Page 13: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/13.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
![Page 14: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/14.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
![Page 15: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/15.jpg)
Alice wants to be loved by all
1
2
2
3
1
Alice is great !
Adding a link to these two individuals
activates the whole network.
They form what we call a pervading
link set.
![Page 16: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/16.jpg)
The modelEach individual has a different given threshold for
activation – some people are easily influenced,
while others are more resilient to new ideas.
Unit weights assumption: each friend of a given
individual has the same influence.
Limited external incentives: the external
influencer (i.e. Alice) has the same weight as every
individual – Alice can only reduce a person's
threshold by 1.
![Page 17: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/17.jpg)
The MinLinks problemGiven: a network G = (V, E, t)
where t(v) is an integer defining the threshold node v
Find: a pervading link set S of minimum size
i.e. a subset S of V such that adding a link to each node in S
activates the entire network.
![Page 18: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/18.jpg)
Related workk-target set problem: choose k nodes that influence
a maximum number of nodes upon activation.
- Question posed by Domingos and Richardson (2001).
- Modeled as a discrete optimization problem by Kempe,
Kleinberg, Tardos (2003).
Probabilistic model of thresholds/influence, the goal is to maximize
expected number of activated nodes.
NP-hard, but admits good constant factor approximation.
![Page 19: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/19.jpg)
Related workMinimum target set problem: activate a minimum number of nodes to activate the whole network.
- Hard to approximate within a polylog factor (Chen, 2004).
- Admits FPT algorithm for graphs of bounded treewidth (Ben-Zwi & al., 2014).
Some issues with the minimum target set:
- A node can be activated at cost 1, regardless of itsthreshold. But some people cannot be influencedby external incentives only.
- No partial incentive can be given: we either activatea node, or we don't. (In our work, we allow nodes to be activated by a mix of internal and externalinfluences.)
![Page 20: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/20.jpg)
Related workMinimum target set problem
1
2
2
3
1
This guy activates the whole
network.
![Page 21: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/21.jpg)
Related workDemaine & al. (2015) introduce a model allowing
partial incentives.
- Maximization of influence using a fixed budget.
- Thresholds are chosen uniformly at random.
- Any amount of external influence can be applied to a
node.
![Page 22: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/22.jpg)
Feasibility of MinLinksGiven a network G, can Alice activate the whole
network?
This can easily be checked in polynomial time
(actually O(|E(G)|) time):
- give a link to everyone
- propagate the influence
- check if the network is activated
![Page 23: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/23.jpg)
Hardness of MinLinksReduction from set cover.
Set cover
Given: a ground set U of size m, and a collection
S = {S1, …, Sn} of subsets of U;
Find: a subcollection S' of S such that each
element of U is in some set of S'.
![Page 24: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/24.jpg)
Hardness of MinLinksConstructing a MinLinks instance from S:
1) To each element of U corresponds a node of G.
2) To each set Si corresponds a node of G which
activates the elements of Si.
3) If each element of U gets activated, the whole
network gets activated.
Objective: S has a set cover of size k
iff k links are enough the corresponding MinLinks
instance.
![Page 25: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/25.jpg)
Hardness of MinLinks
S1 = {1,2,3} S2 = {3, 4}
1 2 3 4 m…
…
{m elements
t = 1
t = m
activate everything !
{n sets
t = 1
![Page 26: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/26.jpg)
Hardness of MinLinks
S1 = {1,2,3} S2 = {3, 4}
1 2 3 4 m…
…
{m elements
t = 1
t = m
… …to S1 to S2
…
… …
{n sets
t = 1
![Page 27: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/27.jpg)
Hardness of MinLinks
S1 = {1,2,3} S2 = {3, 4}
1 2 3 4 m…
…
{m elements
t = 1
t = m
… …to S1 to S2
…
… …
{n sets
t = 1
If there is a set cover
S1, …, Sk
activating the nodes
corresponding to S1, …, Sk
activate the m elements, then
the supernode, then
everything!
![Page 28: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/28.jpg)
Hardness of MinLinks
S1 = {1,2,3} S2 = {3, 4}
1 2 3 4 m…
…
{m elements
t = 1
t = m
… …to S1 to S2
…
… …
{n sets
t = 1
If there is a set cover
S1, …, Sk
activating the nodes
corresponding to S1, …, Sk
activate the m elements, then
the supernode, then
everything!
Problem: S1 activates 3, then
3 activates S2
![Page 29: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/29.jpg)
Hardness of MinLinks
S1 = {1,2,3} S2 = {3, 4}
1 2 3 4 m…
…
{m elements
t = 1
t = m
… …to S1 to S2
…
… …
{n sets
t = 1
If there is a set cover
S1, …, Sk
activating the nodes
corresponding to S1, …, Sk
activate the m elements, then
the supernode, then
everything!…
t = m2
Problem: S1 activates 3, then
3 activates S2.
Add a blocking node of high
threshold (say m2). Now 3
cannot activate S2 by itself.
Repeat for every set element.
![Page 30: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/30.jpg)
Hardness of MinLinksWith some work, and some
more transformations, the
other direction can be made to
work
(from a size k MinLinks we
can construct a size k set
cover)
S1 = {1,2,3} S2 = {3, 4}
1 2 3 4 …{m elements
t = 1
t = m
… …to S1 to S2
…
{n sets
t = 1
m
…
t = m2
![Page 31: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/31.jpg)
Hardness of MinLinksThis reduction can be extended to show the hardness
of this restricted version of MinLinks:
- all nodes have threshold 1 or 2
- each node has at most 3 neighbors
Since SetCover is O(log n)-hard to approximate, and
we preserve the instance size and optimality value,
MinLinks is also O(log n)-hard to approximate.
![Page 32: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/32.jpg)
Set nodes =>
binary trees
Element nodes
=> binary trees
Super activator
=> binary trees
![Page 33: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/33.jpg)
TreesTheorem: if T has a pervading link set, then
for any node v, there is an optimal solution in which v
gets a link.
![Page 34: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/34.jpg)
TreesTheorem: if T has a pervading link set, then
for any node v, there is an optimal solution in which v
gets a link.
Leads to the following O(n) algorithm:
- Give a link to any leaf v of T
- If v gets activated, propagate its influence
- Remove v and all activated nodes
- Repeat on each component
![Page 35: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/35.jpg)
TreesTheorem: The minimum number of links required to
activate a tree T is
ML(T) = 1 + Σv in V(T) (t(v) – 1)
![Page 36: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/36.jpg)
CyclesLemma: a cycle has a pervading link set iff
- t(v) ≤ 3 for every node
- there is at least one node of threshold 1
- between any two consecutive nodes of threshold 3,
there is at least one node of threshold 1
1
3
3
2
1
32
2
1
![Page 37: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/37.jpg)
CyclesLemma: a cycle has a pervading link set iff
- t(v) ≤ 3 for every node
- there is at least one node of threshold 1
- between any two consecutive nodes of threshold 3,
there is at least one node of threshold 1
Theorem: if a cycle C has a pervading link set, then
for any node v of threshold 1, there is an optimal
solution in which v gets a link.
![Page 38: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/38.jpg)
CyclesLeads to the following O(n) algorithm:
- Give a link to a threshold 1 node
- Propagate the influence and remove activated nodes
- The result is a path. Apply the tree algorithm on it.
1
3
3
2
1
32
2
1
1
3
2
2
1
32
1
![Page 39: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/39.jpg)
CyclesTheorem: The minimum number of links required to
activate a cycle C is
ML(C) = max(1, Σv in V(T) (t(v) – 1))
![Page 40: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/40.jpg)
CliquesTheorem: suppose that G is a clique. Order the
vertices (v1, v2, …, vn) by threshold in increasing order.
Then G has a pervading link set iff t(vi) ≤ i for each i.
1
1 3
3 4
![Page 41: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/41.jpg)
CliquesTheorem: suppose that G is a clique. Order the
vertices (v1, v2, …, vn) by threshold in increasing order.
Then G has a pervading link set iff t(vi) ≤ i for each i.
Leads to the following O(n) algorithm:
- Give any threshold 1 node a link.
- Propagate the influence, remove activated nodes.
- Repeat on the resulting clique until nothing remains.
1
1 3
3 4
1
1 2
![Page 42: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/42.jpg)
CliquesTheorem: suppose that G is a clique. Order the
vertices (v1, v2, …, vn) by threshold in increasing order.
Then the minimum number of links required to activate
G is equal to the number of vi such that t(vi) = i.
1
1 3
3 4
1
1 2
![Page 43: WHOM TO BEFRIEND TO INFLUENCE PEOPLEinfo.usherbrooke.ca/mlafond/slides/sirocco2016.pdf · Viral marketing Influencers ... influencer (i.e. Alice) has the same weight as every individual](https://reader033.vdocument.in/reader033/viewer/2022060311/5f0ad9ac7e708231d42da5a6/html5/thumbnails/43.jpg)
ConclusionWhat if we allow multiple influencers?
Allows buying multiple links to a single node
Given k influencers, how many links are needed?
What if the "link budget" is limited?
Maximize the number of activated nodes by using k links.
NP-Hardness follows from our results, but approximability/FPT
is unknown.