The idea is to determine the minimum set of nodes in a social network that could cover the entire network in “k” number of minimum hops. This involves finding the hotspot nodes of the network, that can reach all the nodes with a given probability.