Colorado

This is the directed road network from the 9th DIMACS Implementation Challenge, for the area "Colorado".

Metadata

Code9C
Internal namedimacs9-COL
NameColorado
Data sourcehttp://www.diag.uniroma1.it/challenge9/download.shtml
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Infrastructure network
Dataset timestamp 1991
Node meaningNode
Edge meaningRoad
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops

Statistics

Size n =435,666
Volume m =1,042,400
Wedge count s =908,174
Claw count z =6,431,432
Cross count x =5,890,726
Triangle count t =7,623
Square count q =27,877
4-Tour count T4 =4,898,112
Maximum degree dmax =16
Maximum outdegree d+max =8
Maximum indegree dmax =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
Mean distance δm =453.633
Gini coefficient G =0.208 933
Relative edge distribution entropy Her =0.994 044
Power law exponent γ =2.273 90
Tail power law exponent γt =6.441 00
Degree assortativity ρ =+0.090 016 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+1.000 00
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
Reciprocity y =1.000 00

Plots

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Hop distribution

Clustering coefficient distribution

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 ]