Self-Stabilizing Selection of Influential Users in Social Networks

Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2014 IEEE 17th International Conference on Computational Science and Engineering s. 1558 - 1565
Hlavní autoři: Yihua Ding, Wang, James Z., Srimani, Pradip K.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2014
Témata:
Algorithm design and analysis
Computational modeling
Distributed Scheduler
Influential Users
Minimal Weighted Positive Influence Dominating Set
Network topology
Protocols
Self-Stabilizing Algorithms
Sensitivity
Social network services
Social Networks
Time complexity
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive influence dominating set of a social network graph as the influential users to maximize the speed of the propagation. We present the first polynomial time self-stabilizing algorithm for minimal weighted positive influence dominating set in an arbitrary social network. Starting from an arbitrary initial state, the algorithm terminates in O(n 3 ) steps using a distributed scheduler, where n is the number of nodes in the graph. Space requirement at each node is O(log n) bits. Experiments are conducted to verify the correctness and efficiency of the proposed algorithm.
DOI:10.1109/CSE.2014.288