A Spreader Ranking Algorithm for Extremely Low-budget Influence Maximization in Social Networks using Community Bridge Nodes

by   Aaryan Gupta, et al.

In recent years, social networking platforms have gained significant popularity among the masses like connecting with people and propagating ones thoughts and opinions. This has opened the door to user-specific advertisements and recommendations on these platforms, bringing along a significant focus on Influence Maximisation (IM) on social networks due to its wide applicability in target advertising, viral marketing, and personalized recommendations. The aim of IM is to identify certain nodes in the network which can help maximize the spread of certain information through a diffusion cascade. While several works have been proposed for IM, most were inefficient in exploiting community structures to their full extent. In this work, we propose a community structures-based approach, which employs a K-Shell algorithm in order to generate a score for the connections between seed nodes and communities for low-budget scenarios. Further, our approach employs entropy within communities to ensure the proper spread of information within the communities. We choose the Independent Cascade (IC) model to simulate information spread and evaluate it on four evaluation metrics. We validate our proposed approach on eight publicly available networks and find that it significantly outperforms the baseline approaches on these metrics, while still being relatively efficient.


page 1

page 2

page 3

page 4


Mitigating Misinformation Spreading in Social Networks Via Edge Blocking

The wide adoption of social media platforms has brought about numerous b...

Fair Information Spread on Social Networks with Community Structure

Information spread through social networks is ubiquitous. Influence maxi...

Activating the "Breakfast Club": Modeling Influence Spread in Natural-World Social Networks

While reigning models of diffusion have privileged the structure of a gi...

Modelling Competitive marketing strategies in Social Networks

In a competitive marketing, there are a large number of players which pr...

Towards Direct Comparison of Community Structures in Social Networks

Community detection algorithms are in general evaluated by comparing eva...

Effective Influence Spreading in Temporal Networks with Sequential Seeding

The spread of influence in networks is a topic of great importance in ma...

A Fast Algorithm for Ranking Users by their Influence in Online Social Platforms

Measuring the influence of users in social networks is key for numerous ...

Please sign up or login with your details

Forgot password? Click here to reset