Information Diffusion with SIRP and SEIRP in Social Networks

Abstract

Aiming to improve the traditional SIR and SEIR models for their applications in information diffusion in social networks, this paper introduces public propagation nodes into these two models and consequently proposes an information propagation algorithm. Firstly, through the simulation analysis of the two models SIRP and SEIRP, we explore the factors that affect information dissemination in social networks; secondly, respecting the factors analyzed we propose a greedy algorithm for maximum information dissemination breadth under the assumption of second-degree dissemination. The simulation results show that our information propagation algorithm deserves a practical performance close to that of the optimal propagation algorithm based on the exhaustive method such as enumeration, and nonetheless achieves a better time complexity. To sum up, our information dissemination algorithm has practical value in the information dissemination applications of social networks.