where w i is the weight of orbit i that accounts for dependencies between orbits, as in [27] ; e.g., counts of orbit 3, a triangle, will affect counts of all orbits that contain a triangle. Hence, for each orbit, we count how many orbits affect it and assign a higher weight w i (w i [½0,1) to the orbits that are not affected by many other orbits (see [27] for details). We use log in the formula because the coordinates i and j of the GDV of node v can differ by several orders of magnitude and we do not want the GDC to be entirely dominated by orbits with very large values. We add 1 to v i in the formula to prevent the logarithm function to go to infinity for an orbit count of 0. Finally, we scale the value of the GDC(v) to (0,1] by dividing it with the maximum GDC(u) over all nodes u in the network.