The connection to highly linked nodes in a network (characteristic iii) is measured by the pagerank, and the HITS y-hubs value. The pagerank and HITS y-hubs of a node depend on the respective values of linked nodes. This is solved by multiple iteration steps in the algorithms. Both measures start by assigning a uniform weight distribution to the nodes. The algorithms compute the pagerank and HITS y-hubs of each node based on the according values of the other nodes from the previous iteration step. If the value of each node changes less than the convergence limit of 1×10 -6 in a step the final distribution is found. The weights in pagerank are defined due to the incoming links of the in neighbour of a node. The weights for HITS y-hubs are defined due to the outgoing links of an in neighbour. The pagerank of a node was first introduced in Ref 46 and is implemented in Ref 54: