Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

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.
Journal of Research (NIST JRES) -


approximation algorithms, hitting time, informaton dynamics, Monte Carlo methods, networks, random walks.


Hunt, F. and Pozo, R. (2020), Fast Methods for Finding Multiple Effective Influencers in Real Networks, Journal of Research (NIST JRES), National Institute of Standards and Technology, Gaithersburg, MD, [online], (Accessed July 21, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created December 30, 2020, Updated March 1, 2021