Published May 2, 2014
| Version v1
Conference paper
How to Network in Online Social Networks
Contributors
Others:
- Models for the performance analysis and the control of networks (MAESTRO) ; Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- Dipartimento di Elettronica e Telecomunicazioni [Torino] (DET) ; Politecnico di Torino = Polytechnic of Turin (Polito)
- Design, Implementation and Analysis of Networking Architectures (DIANA) ; Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Description
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.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://inria.hal.science/hal-00954271
- URN
- urn:oai:HAL:hal-00954271v2
Origin repository
- Origin repository
- UNICA