TSITSULIN, Anton, 2021. Similarities and Representations of Graph Structures. PhD Thesis. Universitäts-und Landesbibliothek Bonn. page 
. pdf
Link prediction problem is a node recommendation problem in disguise.
LINIAL, Nathan, 1987. Distributive graph algorithms global solutions from local data. In: 28th Annual Symposium on Foundations of Computer Science (sfcs 1987). IEEE. 1987. p. 331–335. ieee .
This paper deals with distributed graph algorithms. Processors reside in the vertices of a graph G and communicate only with their Neighbors. The system is synchronous and reliable, there is no limit on message lengths and local computation is instantaneous. The results: A maximal independent set in an n-cycle cannot be found faster than Ω(log* n) and this is optimal by [CV]. The d-regular tree of radius r cannot be colored with fewer than √d colors in time 2r / 3. If Δ is the largest degree in G which has order n, then in time O(log*n) it can be colored with O(Δ2) colors.