Fast Methods for Finding Multiple Effective Influencers in Real Networks
Fern Y. Hunt, Roldan Pozo
We present scalable first hitting time methods for finding a collection of nodes that enables the fastest time for the spread of consensus in a network. That is, given a graph G = (V,E) and a natural number k, these methods find k vertices in G that minimize the sum of hitting times (expected number of steps of random walks) from all remaining vertices. Although computationally challenging for general graphs, we exploited the characteristics of real networks and utilized Monte Carlo methods to construct fast approximation algorithms that yield near-optimal solutions.
and Pozo, R.
Fast Methods for Finding Multiple Effective Influencers in Real Networks, Journal of Research (NIST JRES), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/jres.125.036
(Accessed April 19, 2021)