Compensatory seeding in networks with varying avaliability of nodes

  • Authors:
  • Jarosław Jankowski;Radosław Michalski;Przemysław Kazienko

  • Affiliations:
  • West Pomeranian University of Technology, Szczecin, Poland;Wrocław University of Technology, Wrocław, Poland;Wrocław University of Technology, Wrocław, Poland

  • Venue:
  • Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Diffusion of information in social networks takes more and more attention from marketers. New methods and algorithms are constantly developed towards maximizing reach of the campaigns and increasing their effectiveness. One of the important research directions in this area is related to selecting initial nodes of the campaign to result with maximizing its effects represented as total number of infections. To achieve this goal, several strategies were developed and they are based on different network measures and other characteristics of users. The problem is that most of these strategies base on static network properties while typical online networks change over time and are sensitive to varying activity of users. In this work a novel strategy is proposed which is based on multiple measures with additional parameters related to nodes availability in time periods prior to the campaign. Presented results show that it is possible to compensate users with high network measures by others having high frequency of system usage, which, instead, may be easier or cheaper to acquire.