Colorado
This is the directed road network from the 9th DIMACS Implementation Challenge,
for the area "Colorado".
Metadata
Statistics
Size | n = | 435,666
|
Volume | m = | 1,042,400
|
Loop count | l = | 0
|
Wedge count | s = | 908,174
|
Cross count | x = | 5,890,726
|
Triangle count | t = | 7,623
|
Square count | q = | 27,877
|
Maximum degree | dmax = | 16
|
Maximum outdegree | d+max = | 8
|
Maximum indegree | d−max = | 8
|
Average degree | d = | 4.785 32
|
Fill | p = | 5.491 97 × 10−6
|
Size of LCC | N = | 435,666
|
Size of LSCC | Ns = | 435,666
|
Relative size of LSCC | Nrs = | 1.000 00
|
Diameter | δ = | 1,255
|
50-Percentile effective diameter | δ0.5 = | 414.469
|
90-Percentile effective diameter | δ0.9 = | 804.657
|
Median distance | δM = | 415
|
Mean distance | δm = | 453.633
|
Gini coefficient | G = | 0.208 933
|
Balanced inequality ratio | P = | 0.421 721
|
Outdegree balanced inequality ratio | P+ = | 0.421 721
|
Indegree balanced inequality ratio | P− = | 0.421 721
|
Relative edge distribution entropy | Her = | 0.994 044
|
Power law exponent | γ = | 2.273 90
|
Tail power law exponent | γt = | 6.441 00
|
Tail power law exponent with p | γ3 = | 6.441 00
|
p-value | p = | 0.000 00
|
Outdegree tail power law exponent with p | γ3,o = | 6.441 00
|
Outdegree p-value | po = | 0.000 00
|
Indegree tail power law exponent with p | γ3,i = | 6.441 00
|
Indegree p-value | pi = | 0.000 00
|
Degree assortativity | ρ = | +0.090 016 4
|
Degree assortativity p-value | pρ = | 0.000 00
|
Clustering coefficient | c = | 0.025 181 3
|
Directed clustering coefficient | c± = | 0.025 181 3
|
Spectral norm | α = | 8.083 74
|
Operator 2-norm | ν = | 4.041 87
|
Cyclic eigenvalue | π = | 4.041 87
|
Algebraic connectivity | a = | 1.242 11 × 10−6
|
Spectral separation | |λ1[A] / λ2[A]| = | 1.016 04
|
Non-bipartivity | bA = | 0.031 638 7
|
Normalized non-bipartivity | bN = | 0.000 187 031
|
Spectral bipartite frustration | bK = | 3.877 48 × 10−5
|
Controllability | C = | 44,642
|
Relative controllability | Cr = | 0.102 468
|
Plots
Matrix decompositions plots
Downloads
References
[1]
|
Jérôme Kunegis.
KONECT – The Koblenz Network Collection.
In Proc. Int. Conf. on World Wide Web Companion, pages
1343–1350, 2013.
[ http ]
|