Scalable Methods for Adaptively Seeding a Social Network

TL;DR

This paper introduces scalable adaptive seeding algorithms for social networks that leverage the friendship paradox to improve information spread, demonstrating significant advantages over traditional methods through empirical evaluation.

Contribution

The authors develop and analyze scalable algorithms for adaptive influence maximization that utilize the friendship paradox, with provable guarantees and parallel implementation.

Findings

Adaptive seeding significantly outperforms standard approaches.

Algorithms are scalable and can be parallelized effectively.

Empirical results show improved information dissemination across multiple social network datasets.

Abstract

In recent years, social networking platforms have developed into extraordinary channels for spreading and consuming information. Along with the rise of such infrastructure, there is continuous progress on techniques for spreading information effectively through influential users. In many applications, one is restricted to select influencers from a set of users who engaged with the topic being promoted, and due to the structure of social networks, these users often rank low in terms of their influence potential. An alternative approach one can consider is an adaptive method which selects users in a manner which targets their influential neighbors. The advantage of such an approach is that it leverages the friendship paradox in social networks: while users are often not influential, they often know someone who is. Despite the various complexities in such optimization problems, we show that scalable adaptive seeding is achievable. In particular, we develop algorithms for linear influence models with provable approximation guarantees that can be gracefully parallelized. To show the effectiveness of our methods we collected data from various verticals social network users follow. For each vertical, we collected data on the users who responded to a certain post as well as their neighbors, and applied our methods on this data. Our experiments show that adaptive seeding is scalable, and importantly, that it obtains dramatic improvements over standard approaches of information dissemination.