On the effectiveness of random jumps in an influence maximization algorithm for unknown graphs
On minimizing budget and time in influence propagation over social networks