CHANGE. To facilitate an effective HIV intervention campaign, a state-of-art method was recently proposed [1]}. This model was inspired by the friendship paradox, which states that the expected degree of a random node’s neighbor(s) is larger than that of the random node itself [2]}. In this context, a random neighbor of a node in \(G_t\)  is selected to query at each query step \(t\)  in the network discovery phase. Similarly as in Rand, the greedy IM algorithm is used to obtain \(k\)  seed nodes from the explored graph \(G_T\) .
