How to Network in Online Social Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

How to Network in Online Social Networks

(1) , (2) , (3) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
influence.pdf (176.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00954271 , version 1 (28-02-2014)
hal-00954271 , version 2 (04-03-2014)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
356 View
225 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More