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 metadatas

https://hal.inria.fr/hal-00954271
Contributor : Maksym Gabielkov <>
Submitted on : Friday, February 28, 2014 - 6:47:13 PM
Last modification on : Sunday, June 14, 2020 - 11:28:02 AM
Long-term archiving on: : Friday, May 30, 2014 - 3:45:56 PM

File

influence.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00954271, version 1

Citation

Giovanni Neglia, Xiuhui Ye, Maksym Gabielkov, Arnaud Legout. How to Network in Online Social Networks. NetSciCom 2014 - The Sixth IEEE International Workshop on Network Science for Communication Networks, May 2014, Toronto, Canada. ⟨hal-00954271v1⟩

Share

Metrics

Record views

74

Files downloads

8