Number of vertices , number of edges , average degree , number of connected components , average path length , clustering coefficient , and coefficient of assortativity .
N, L and Nc denote the number of nodes, edges and connected components, respectively; LCC stands for Largest Connected Component; 〈k〉 is the average degree of the network; the fill is defined as the r
Average value of edge betweenness in network neighbourhood links and in spatial neighbourhood links, for each component of more than 10 nodes within each network.
This dataset consists of 25-45 node graphs generated via BA [1] with uniformly randomly scattered nodes over a grid the size of north america with a minimim of 100km between...
and are the number of nodes and links, and are the maximum of in-degree and out-degree of all nodes, and is the average degree of all nodes (average in-degree equals average out-degree). and are the 9