How to Network in Online Social Networks

Giovanni Neglia 1, * Xiuhui Ye 2 Maksym Gabielkov 3 Arnaud Legout 3
* Auteur correspondant
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.
Type de document :
Communication dans un congrès
6th IEEE INFOCOM International Workshop on Network Science for Communication Networks (NetSciCom 2014), May 2014, Toronto, Canada. pp.819-824, 2014, 〈10.1109/INFCOMW.2014.6849336〉
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-00954271
Contributeur : Maksym Gabielkov <>
Soumis le : mardi 4 mars 2014 - 17:29:45
Dernière modification le : jeudi 11 janvier 2018 - 16:57:59
Document(s) archivé(s) le : mercredi 4 juin 2014 - 12:10:57

Fichiers

influence.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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, 2014, 〈10.1109/INFCOMW.2014.6849336〉. 〈hal-00954271v2〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

585

Téléchargements de fichiers

235

Contact


archive-ouverte@inria.fr