Papers › A Numerical Evaluation of the Accuracy of Influence Maximization Algorithms
A Numerical Evaluation of the Accuracy of Influence Maximization Algorithms
Hautahi Kingi, Li-An Daniel Wang, Tom Shafer, Minh Huynh, MikeTrinh, Aaron Heuser
We develop an algorithm to compute exact solutions to the influence maximization problem using concepts from reverse influence sampling (RIS). We implement the algorithm using GPU resources to evaluate the empirical accuracy of theoretically-guaranteed greedy and RIS approximate solutions. We find that the approximations yield solutions that are remarkably close to optimal — usually achieving greater than 99% of the optimal influence spread. These results are consistent across a wide range of network structures.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections