Figure 1
From: Weight prediction in complex networks based on neighbor set

An illustration of neighbor set.
In this example, neighbor set A is defined as the set of neighbors of node α, which are a, b, c and d. Neighbor set B consists of three nodes, namely, d, e and f. Note that node α and node β have one common neighbor, which belongs to both neighbor sets A and B. Within neighbor set A, because there is only one link, the existence probability for the remaining possible links is , while the remaining links in neighbor set B exist with probability
. Connections across neighbor sets A and B exist with probability
.