As there can be large number of neighbors, we collect the neighborhood set for each entity as a pre-processing step using a random walk method.
given a node e, we run k rounds of random-walks of length l following (Hamilton et al., 2017) and create set N (e) by adding all unique nodes visited across these walks.