Following the example of (10) the shortest path similarity was also calculated, which was simply taken to be one over the length of the shortest path between two vertices (and zero if no path exists) . Clauset et al. also compare their model to the number of common neighbours, very similar to the Jaccard index, defined as follows :