Maximizing spreading influence via measuring influence overlap for social networks

Abstract

Influence overlap is a universal phenomenon in influence spreading for social networks. In this paper, we argue that the redundant influence generated by influence overlap cause negative effect for maximizing spreading influence. Firstly, we present a theoretical method to calculate the influence overlap and record the redundant influence. Then in term of eliminating redundant influence, we present two algorithms, namely, Degree-Redundant-Influence (DRS) and Degree-Second-Neighborhood (DSN) for multiple spreaders identification. The experiments for four empirical social networks successfully verify the methods, and the spreaders selected by the DSN algorithm show smaller degree and k-core values.

arXiv comment20 pages, 6 figures

References in corpus (9)

• Identification of influential spreaders in complex networks
• Influence maximization in complex networks through optimal percolation
• Epidemic dynamics in finite size scale-free networks
• Identifying influential spreaders in complex networks based on gravity formula
• Identify influential spreaders in complex networks, the role of neighborhood
• Local structure can identify and quantify influential global spreaders in large scale social networks
• Affinity Paths and Information Diffusion in Social Networks
• A message-passing approach for recurrent-state epidemic models on networks
• Identifying effective multiple spreaders by coloring complex networks