How to Network in Online Social Networks

Giovanni Neglia 1, * Xiuhui Ye 2 Maksym Gabielkov 3 Arnaud Legout 3
* Corresponding author
1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
2 DET - Dipartimento di Elettronica e Telecomunicazioni [Turin]
3 DIANA - Design, Implementation and Analysis of Networking Architectures
CRISAM - Inria Sophia Antipolis - Méditerranée
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

Cited literature [11 references]  Display  Hide  Download
https://hal.inria.fr/hal-00954271
Contributor : Maksym Gabielkov <>
Submitted on : Tuesday, March 4, 2014 - 5:29:45 PM
Last modification on : Thursday, January 11, 2018 - 4:57:59 PM
Long-term archiving on : Wednesday, June 4, 2014 - 12:10:57 PM

Files

influence.pdf
Files produced by the author(s)

Identifiers

Collections

INRIA | UNIV-COTEDAZUR

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

663

Files downloads

336

Contact


archive-ouverte@inria.fr