Skip to Main content Skip to Navigation
Conference papers

How to Network in Online Social Networks

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Maksym Gabielkov Connect in order to contact the contributor
Submitted on : Tuesday, March 4, 2014 - 5:29:45 PM
Last modification on : Tuesday, November 30, 2021 - 2:32:02 PM
Long-term archiving on: : Wednesday, June 4, 2014 - 12:10:57 PM


Files produced by the author(s)




Giovanni Neglia, Xiuhui Ye, Maksym Gabielkov, Arnaud Legout. How to Network in Online Social Networks. 6th IEEE INFOCOM International Workshop on Network Science for Communication Networks (NetSciCom 2014), May 2014, Toronto, Canada. pp.819-824, ⟨10.1109/INFCOMW.2014.6849336⟩. ⟨hal-00954271v2⟩



Les métriques sont temporairement indisponibles