Seeds Buffering for Information Spreading Processes
arXiv:1709.04863 · doi:10.1007/978-3-319-67217-5_37
Abstract
Seeding strategies for influence maximization in social networks have been studied for more than a decade. They have mainly relied on the activation of all resources (seeds) simultaneously in the beginning; yet, it has been shown that sequential seeding strategies are commonly better. This research focuses on studying sequential seeding with buffering, which is an extension to basic sequential seeding concept. The proposed method avoids choosing nodes that will be activated through the natural diffusion process, which is leading to better use of the budget for activating seed nodes in the social influence process. This approach was compared with sequential seeding without buffering and single stage seeding. The results on both real and artificial social networks confirm that the buffer-based consecutive seeding is a good trade-off between the final coverage and the time to reach it. It performs significantly better than its rivals for a fixed budget. The gain is obtained by dynamic rankings and the ability to detect network areas with nodes that are not yet activated and have high potential of activating their neighbours.
Jankowski, J., Bródka, P., Michalski, R., & Kazienko, P. (2017, September). Seeds Buffering for Information Spreading Processes. In International Conference on Social Informatics (pp. 628-641). Springer
References in corpus (9)
- Finding community structure in networks using the eigenvectors of matrices
- The structure of scientific collaboration networks
- Identification of influential spreaders in complex networks
- Influence maximization in complex networks through optimal percolation
- Graph Evolution: Densification and Shrinking Diameters
- Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach
- Scalable Methods for Adaptively Seeding a Social Network
- Identifying a set of influential spreaders in complex networks
- Balancing Speed and Coverage by Sequential Seeding in Complex Networks