According to our definition, a node that lies n hops away from p has an n-order co-occurrence with p. Considering the fact that a single web page might link to many pages with diverse topics, higher order co-occurrences with p (i.e.
nodes that appear further from p) are unreliable as aliases of p. we limit C(p), the set of candidate aliases of p, to nodes which are directly  connected to p in the graph.