Besides, we examine the neighborhood structure of the vertices.
we check the top-K nearest vertices for each vertex in the embedded social space and calculate how many of the vertex pairs have edges between them in the observed network.