Fig. 2From: The risk of node re-identification in labeled social graphsExample of a node signature defined as a combined feature vector made up from NDD and NAD vectors. In the NDD vector, each bin value corresponds to the number of nodes that have a degree value represented in the bin range, such that the jth bin holds the nodes in the degree (kj) range j×b≤kj<(j+1)×b. If the degree exceeds the maximum range, such nodes are included in the last bin. Further, both 1-hop and 2-hop NDDs are calculated and merged. For example, node x has no 1-hop neighbor nodes that have degree in the range of 1−2, and one 2-hop neighbor node that its degree is in the range of 1−2. In the NAD vector, each element corresponds to the number of nodes with the given attribute. Both 1-hop and 2-hop NADs are calculated and merged. Node x has one 1-hop neighbor node, and two 2-hop neighbor nodes with the attribute Red. Note that the node value represents the associated degree, and the border color represents the node attribute Red or BlueBack to article page