Title :
How to network in online social networks
Author :
Neglia, G. ; Xiuhui Ye ; Gabielkov, Maksym ; Legout, Arnaud
fDate :
April 27 2014-May 2 2014
Abstract :
In this paper, we consider how to maximize users´ influence in Online Social Networks (OSNs) by exploiting social relationships only. Our first contribution is to extend to OSNs the model of Kempe et al. [1] on the propagation of information in a social network and to show that a greedy algorithm is a good approximation of the optimal algorithm that is NP-hard. However, the greedy algorithm requires global knowledge, which is hardly practical. Our second contribution is to show on simulations on the full Twitter social graph that simple and practical strategies perform close to the greedy algorithm.
Keywords :
approximation theory; computational complexity; graph theory; greedy algorithms; social networking (online); social sciences computing; NP-hard; OSN; Twitter social graph; greedy algorithm; information propagation; online social networks; social relationships; user influence maximization; Approximation algorithms; Approximation methods; Communication networks; Greedy algorithms; Recruitment; Twitter;
Conference_Titel :
Computer Communications Workshops (INFOCOM WKSHPS), 2014 IEEE Conference on
Conference_Location :
Toronto, ON
DOI :
10.1109/INFCOMW.2014.6849336
