On the effectiveness of random jumps in an influence maximization algorithm for unknown graphs
Assortative Mixing in Networks