How to Network in Online Social Networks
Social and Information Networks
2014-03-05 v1 Physics and Society
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
Cite
@article{arxiv.1403.0850,
title = {How to Network in Online Social Networks},
author = {Giovanni Neglia and Xiuhui Ye and Maksym Gabielkov and Arnaud Legout},
journal= {arXiv preprint arXiv:1403.0850},
year = {2014}
}
Comments
NetSciCom 2014 - The Sixth IEEE International Workshop on Network Science for Communication Networks (2014)