Fig. 7
From: Unsupervised evaluation of multiple node ranks by reconstructing local structures
Evaluating triadic closure prediction in a network (left) in which estimated link ranks \(\widehat {M}\) (middle left) assume near-zero values for the dashed links and near-one for the blue links. LinkCC over the neighborhood of nodes A (middle right) and E (right) assumes that immediate neighbors are known and evaluates how many triangles are formed between them compared to the number of triangles in the original network