|
Empirical network
|
Random network
|
---|
N
|
E
|
Modularity
|
avgCC
|
APL
|
ND
|
AD
|
GD
|
σ
|
Modularity
|
avgCC
|
APL
|
---|
Positive
|
Negative
|
---|
River
|
189
|
443 (96.3%)
|
17 (3.7%)
|
0.653
|
0.376
|
7.07
|
17
|
4.87
|
0.026
|
3.2
|
0.412
|
0.056
|
3.33
|
Lake
|
115
|
1417 (67.3%)
|
687 (32.7%)
|
0.211
|
0.549
|
1.70
|
3
|
36.59
|
0.321
|
1.4
|
0.086
|
0.397
|
1.69
|
- N: No. of nodes; E: No. of edges; avgCC: Average clustering coefficient; APL: Average path length; ND: network diameter; AD: Average degree; GD: Graph density; σ: small-word coefficient
- σ = (avgCC/avgCCr)/(APL/APLr) and σ > 1 indicates “small-world” properties, i.e., high interconnectivity and high efficiency [39]. Subscript r indicates the properties of the random network