Random (Rand). We randomly select a queried node for each round of exploration. Then, after \(T\)  query rounds, the greedy IM algorithm in [1]} is used to obtain \(k\)  seed nodes from the explored graph \(G_T\)  without network inference.
